DATA STRUCTURES (DS) - S3
5.0
(1)
11 learners
What you'll learn
This course includes
- 10 hours of video
- Certificate of completion
- Access on mobile and TV
Course content
1 modules • 59 lessons • 10 hours of video
DATA STRUCTURES (DS) - S3
59 lessons
• 10 hours
DATA STRUCTURES (DS) - S3
59 lessons
• 10 hours
- DS - MODULE 1 - TOPIC 1 - ALGORITHM & ALGORITHM ANALYSIS14:18
- DS - MODULE 1 - TOPIC 2 - TIME & SPACE COMPLEXITY10:01
- DS - MODULE 1 - TOPIC 3 - PERFORMANCE EVALUATION05:18
- DS - MODULE 1 - TOPIC 4 - FREQUENCY COUNT METHOD TO CALCULATE TIME COMPLEXITY OF AN ALGORITHM12:52
- DS - MODULE 1 - TOPIC 5 - ASYMPTOTIC NOTATIONS FOR COMPLEXITY OF ALGORITHMS14:24
- DS - MODULE 1 - TOPIC 6 - MASTER'S THEOREM08:41
- DS - MODULE 2 - TOPIC 1 - ARRAY & REPRESENTATION OF ARRAYS14:56
- DS - MODULE 2 - TOPIC 2 - REPRESENTATION OF ARRAYS (CONTINUATION)10:36
- DS - MODULE 2 - TOPIC 3 - REPRESENTATION OF POLYNOMIAL USING ARRAY10:07
- DS - MODULE 2 - TOPIC 4 - STACK12:44
- DS - MODULE 2 - TOPIC 5 - EVALUATION OF POSTFIX EXPRESSION05:58
- DS - MODULE 2 - TOPIC 6 - INFIX TO POSTFIX CONVERSION USING STACK12:54
- DS - MODULE 2 - TOPIC 7 - QUEUE11:18
- DS - MODULE 2 - TOPIC 8 - CIRCULAR QUEUE10:32
- DS - MODULE 2 - TOPIC 9 - PRIORITY QUEUE, DOUBLE ENDED QUEUE & APPLICATIONS OF QUEUE07:04
- DS - MODULE 2 - TOPIC 10 - LINEAR SEARCH10:09
- DS - MODULE 2 - TOPIC 11 - BINARY SEARCH12:40
- DS - MODULE 3 - TOPIC 1 - SELF REFERENTIAL STRUCTURE10:49
- DS - MODULE 3 - TOPIC 2 - DYNAMIC MEMORY ALLOCATION09:33
- DS - MODULE 3 - TOPIC 3 - ALGORITHM TO INSERT A NODE ON THE FRONT14:57
- DS - MODULE 3 - TOPIC 4 - INSERTING A NODE AT THE END OF LIST10:01
- DS - MODULE 3 - TOPIC 5 - INSERT A NEW NODE BETWEEN TWO NODES AFTER A GIVEN DATA VALUE12:11
- DS - MODULE 3 - TOPIC 6 - DELETING FIRST & LAST NODE FROM LINKED LIST08:50
- DS - MODULE 3 - TOPIC 7 - DELETE A NODE FROM MIDDLE , AFTER A GIVEN DATA VALUE07:11
- DS - MODULE 3 - TOPIC 8 - DOUBLY LINKED LIST07:57
- DS - MODULE 3 - TOPIC 9 - CIRCULAR LINKED LIST09:09
- DS - MODULE 3 - TOPIC 10 - STACK USING LINKED LIST08:39
- DS - MODULE 3 - TOPIC 11 - QUEUE USING LINKED LIST08:00
- DS - MODULE 3 - TOPIC 12 - MEMORY ALLOCATION SCHEME - FIRST FIT, BEST FIT & WORST FIT11:02
- DS - MODULE 4 - TOPIC 1 - TREE09:33
- DS - MODULE 4 - TOPIC 2 - BINARY TREE11:11
- DS - MODULE 4 - TOPIC 3 - TREE REPRESENTATIONS11:55
- DS - MODULE 4 - TOPIC 4 - INORDER TRAVERSAL09:43
- DS - MODULE 4 - TOPIC 5 - PRE-ORDER TRAVERSAL & POST ORDER TRAVERSAL11:00
- DS - MODULE 4 - TOPIC 6 - INORDER, PREORDER & POSTORDER USING RECURSION12:13
- DS - MODULE 4 - TOPIC 7 - COPY OF A BINARY TREE09:37
- DS - MODULE 4 - TOPIC 8 - THREADED BINARY TREE09:57
- DS - MODULE 4 - TOPIC 9 - BINARY TREE REPRESENTATION OF TREES06:01
- DS - MODULE 4 - TOPIC 10 - CREATION OF A BINARY TREE (PREORDER & INORDER GIVEN)10:20
- DS - MODULE 4 - TOPIC 11 - CREATION OF BINARY TREE (POSTORDER & INORDER GIVEN)07:42
- DS - MODULE 4 - TOPIC 12 - BINARY SEARCH TREE (BST)09:42
- DS - MODULE 4 - TOPIC 13 - CREATION & DELETION IN BINARY SEARCH TREE07:34
- DS - MODULE 4 - TOPIC 14 - CONSTRUCTING AN EXPRESSION TREE04:46
- DS - MODULE 4 - TOPIC 15 - GRAPH (BASICS)15:02
- DS - MODULE 4 - TOPIC 16 - DEPTH FIRST SEARCH (DFS)12:06
- DS - MODULE 4 - TOPIC 17 - DFS IN DIRECTED GRAPH08:48
- DS - MODULE 4 - TOPIC 18 - BREADTH FIRST SEARCH (BFS)09:41
- DS - MODULE 4 - TOPIC 19 - GRAPH REPRESENTATIONS IN MEMORY(ADJACENCY MATRIX)10:46
- DS - MODULE 4 - TOPIC 20 - ADJACENCY LIST REPRESENTATION08:52
- DS - MODULE 4 - TOPIC 21 - ADJACENCY MULTILIST12:01
- DS - MODULE 5 - TOPIC 1- HASHING & HASH TABLES11:41
- DS - MODULE 5 - TOPIC 2 - HASHING FUNCTIONS10:46
- DS - MODULE 5 - TOPIC 3 - COLLISION RESOLUTION (OVERFLOW HANDLING) TECHNIQUES12:55
- DS - MODULE 5 - TOPIC 4 - COLLISION RESOLUTION (CHAINING METHODS)09:28
- DS - MODULE 5 - TOPIC 5 - HEAP & HEAP SORTING13:35
- DS - EXTRA TOPIC 1 - MATRIX MULTIPLICATION ALGORITHM12:42
- DS - EXTRA TOPIC - MINIMUM COST SPANNING TREE USING KRUSKAL ALGORITHM09:42
- DATA STRUCTURE - 2019 SCHEME - MOST IMPORTANT TOPICS FOR KTU UNIVERSITY EXAM10:26
- DATA STRUCTURE - KTU MODEL QUESTION PAPER OUT - 2019 SCHEME11:56
![Curso de Inversión en Bolsa desde CERO 💰 [Paso a Paso]](https://i.ytimg.com/vi/8-q2F2L64yk/hqdefault.jpg)
