Channel Avatar

DIVVELA SRINIVASA RAO

61.7K subscribers

It is an educational channel contains technical videos for B.TECH CSE/IT ,MCA,BSC COMPUTER SCIENC ...


23:51
Job Sequencing with Deadlines Problem using Greedy Method (Program & Example) || Greedy Method | DAA
01:01:29
Minimization of DFA (Finite Automata) || Partition Method || DFA Minimization || DFA || TOC || FLAT
41:50
Minimization of DFA (Finite Automata) || Partition Method || DFA Minimization || DFA || TOC || FLAT
46:11
Minimization of DFA (Finite Automata) || Partition Method || DFA Minimization || DFA || TOC || FLAT
38:13
Min Heap Insertion and Deletion || Min Heap Program || Min Heap || Min Heap Example || Heap || DS
34:29
Max Heap Insertion and Deletion || Max Heap Program || Max Heap || Max Heap Example || Heap || DS
01:04:09
Converting NFA to DFA || NFA to DFA Conversion || Equivalence of DFA and NFA || TOC || FLAT ||
20:06
NFA to DFA Conversion || Equivalence of DFA and NFA || Conversion of NFA to DFA || TOC || FLAT
21:50
Converting NFA to DFA || Equivalence of DFA and NFA || Conversion of NFA to DFA || TOC || FLAT
22:14
NFA to DFA Conversion || Equivalence of DFA and NFA || Conversion of NFA to DFA || TOC || FLAT
17:32
Converting NFA to DFA || Equivalence of DFA and NFA || Conversion of NFA to DFA || TOC || FLAT
01:00:48
Quick Sort Program || Quick Sort || Quick Sort example || Quick Sort Program in C || Sorting || ADS
27:06
Finding maximum and minimum element using Divide and Conquer || Program || Example || Max and Min
19:38
AI vs ML vs DL || Difference Between AI, ML & DL || Compare AI, ML & DL || AI || ML || DL || DS
30:48
Merge Sort Program || Merge Sort || Merge Sort example || Merge Sort Program in C || Sorting || ADS
18:09
Difference Between Machine Learning and Deep Learning || Machine Learning vs Deep Learning || ML
21:56
Applications of AVL Tree || Advantages of AVL Tree || Disadvantages of AVL Tree || AVL Tree || ADS
38:44
C Program to Implement AVL Tree || AVL Tree Operations in C || AVL Tree Program || AVL Tree
22:41
Applications of B-Tree || Advantages of B-Tree || Disadvantages of B-Tree || B Tree || B-Tree
17:43
Randomized Quick Sort || Randomized QuickSort Program || Data Structures || QuickSort || Quick Sort
23:01
B-Tree insertion of order 3 || B-Tree of Order 3 || B Tree Insertion || B-Tree || B Tree of Order 3
00:16
ప్రపంచంలో తప్పక చూడాల్సిన ఎనిమిది ముఖ్యమైన ప్రదేశాలు || See the Eight Important Places in the World
07:45
ఐఐటీ హైదరాబాద్ లో ఉన్న అద్భుతమైన లైబ్రరీనీ తప్పనిసరిగా చూడండి || IIT Hyderabad Excellent Library
15:42
Array Operations || C Program to Perform Array Operations || C Programming || Array || Arrays || C
31:19
Bus Structure in Computer Architecture || Types of Buses (Data Bus, Address Bus, Control Bus) ||
36:50
Von Neumann Architecture || Stored Program Concept in Computer Architecture || CO || CA | COA | DLCO
12:09
Difference Between Multiprocessor and Multicomputer || Multiprocessor and Multi computer || CO | CA
00:44
Nice Video with Andhra Pradesh and Telangana Chief Ministers and Deputy Chief Ministers
13:00
Simplifying Boolean Expression || Simplify the Boolean expression Using Boolean Algebra Laws || DLD
10:23
Draw the Logic Diagram using Basic Gates || Draw the Logic Circuit using AOI Logic || DLD || DLCO
01:57:17
0/1 Knapsack Problem Using FIFO Branch and Bound ( FIFOBB ) || 0/1 Knapsack Problem || DAA ||| ADSA
01:13:59
0/1 Knapsack Problem using Least Cost Branch and Bound ( LCBB ) || 0/1 Knapsack Problem || DAA | ADS
01:53
Best Teacher Award Video
26:30
Construct AVL Tree for the Days of a Week || AVL Tree for the Strings || AVL Tree Insertion || DS
50:19
Construct AVL tree for the elements 1,2,3,4,5,6,7,8,9,10 || AVL Tree for 1 to 10 numbers || ADS ||
30:07
AVL Tree for the Strings || AVL Tree Insertion || Construct AVL Tree for the Strings || DS || ADS
41:32
AVL Tree for the Months || AVL Tree Insertion || Construct AVL Tree for the Months || DS || ADS
01:12:43
Min Heap Insertion and Deletion || Min Heap || Min Heap Insertion || Min Heap Deletion || DS || ADS
01:10:41
Max Heap Insertion and Deletion || Max Heap || Max Heap Insertion || Max Heap Deletion || DS || ADS
58:53
Min Heap Insertion and Deletion || Min Heap || Min Heap Insertion || Min Heap Deletion || DS || ADS
32:37
Max Heap Insertion and Deletion || Max Heap || Max Heap Insertion || Max Heap Deletion || DS || ADS
40:42
Queue Operations in Data Structure || Queue in Data Structure || Queue using Arrays || Queue || ADS
33:59
Queue in Data Structure || Introduction to Queue in Data Structures || Queue using Arrays || DS
34:27
AVL Tree Deletion || AVL Tree Deletion with Example || AVL Tree Deletion Example || AVL Tree || DS
59:07
AVL Tree Insertion || Construct AVL Tree for the Elements 7,14,2,5,10,33,56,30,15,25,66,70,4 || DS
23:19
Queue using Arrays || Implementation of Queue using Arrays || Queue using Array || Queue || DS
44:32
Stack in Data Structure || Introduction to Stack || Stack Operations || What is Stack || DS || ADS
27:24
Stack using Array || Implementation of Stack using Array || Stack using Arrays || DS || ADS
18:23
Space Complexity || Calculating Space Complexity || Algorithm Analysis || Space Complexity Example
31:40
Time Complexity || Frequency Count Method || Calculating Time Complexity || Algorithm Analysis ||
22:01
Time Complexity || Algorithm Analysis || Frequency Count Method Calculating Time Complexity || ADS
13:14
Algorithm Analysis || Priori Analysis || Posteriori Analysis || Priori Vs Posteriori Analysis | ADS
16:01
Algorithm || Characteristics of an Algorithm || Properties of an Algorithm || Advantages || DS | ADS
24:03
Reversing String using Stack || Reversing List using Stack || Applications of Stack || DS
08:30
Expressions in Data Structures || Infix Expression || Postfix Expression || Prefix Expression || DS
24:47
(Program) Balancing Symbols using Stack || Balanced Parentheses using Stack || Applications of Stack
20:50
Balancing Symbols using Stack || Balanced Parentheses using Stack || Applications of Stack || DS
32:32
(Program) Infix to Prefix using Stack || Infix to Prefix Conversion || Infix to Prefix Algorithm
22:17
Infix to Prefix using Stack || Infix to Prefix Conversion || Infix to Prefix Algorithm || DS
05:40
A good idea that will benefit the poor people in society ||