Chapter 1 : Introduction
Topic : Data and Information, Data Structure, Classification of Data Structures, Primitive Data Types, Abstract Data Types
Content : Explanation 47 MB ,23:17 MIN , THEORY

Chapter 1 : introduction
Topic : Operations on Data Structure
Content : Explanation 20 MB ,11:31 MIN , THEORY

Chapter 1 : introduction
Topic : Algorithm, Importance of Algorithm Analysis, Complexity of an Algorithm, Asymptotic Analysis and Notations, Big O Notation, Big Omega Notation, Big Theta Notation, Rate of Growth and Big O Notation
Content : Importance of Algorithm Analysis, Complexity of an Algorithm, Asymptotic Analysis and Notations 35 MB ,21:53 MIN , THEORY

Chapter 2 : Arrays
Topic : Introduction, One Dimensional Array, Memory Representation of One Dimensional Array, Traversing, Insertion, Deletion, Searching, Sorting, Merging of Arrays
Content : Explanation 16 MB ,10:26 MIN , THEORY

Chapter 2 : Arrays
Topic : Multidimensional Arrays, Memory Representation of Two Dimensional Arrays, General Multi-Dimensional Arrays, Sparse Arrays, Sparse Matrix, Memory Representation of Special kind of Matrices, Advantages and Limitations of Arrays, Advantages and Limitations of Arrays.
Content : Explanation 35 MB ,21:11 MIN , THEORY

Chapter 1 : Linked List
Topic : Introduction to Linked List
Content : Introduction to Linked List, Type of Linked List 80 MB ,44:53 MIN , THEORY

Chapter 1 : Linked List
Topic : Circular Linked List, Applications of Circular Linked List,
Content : Circular Linked List, Applications of Circular Linked List, 13 MB ,7:27 MIN , THEORY

Chapter 1 : Linked List
Topic : Copying a List into Other List, Merging Two Linked Lists, Splitting a List into Two Lists, Reversing One way linked List,
Content : Copying a List into Other List, Merging Two Linked Lists, Splitting a List into Two Lists, Reversing One way linked List, 50 MB ,28:12 MIN , THEORY + PRACTICAL

Chapter 1 : Linked List
Topic : One-way Linked List, Traversal of Linked List, Searching, Memory Allocation and De-allocation, Insertion in Linked List, Deletion from Linked List,
Content : One-way Linked List, Traversal of Linked List, Searching, Memory Allocation and De-allocation, Insertion in Linked List, Deletion from Linked List, 97 MB ,51:5 MIN , THEORY + PRACTICAL

Chapter 1 : Linked List
Topic : Header Linked List,
Content : Header Linked List, 5 MB ,3:9 MIN , THEORY

Chapter 1 : Linked List
Topic : Applications of the Linked list, Representation of Polynomials, Storage of Sparse Arrays, Implementing other Data Structures.
Content : Applications of the Linked list, Representation of Polynomials, Storage of Sparse Arrays, Implementing other Data Structures. 30 MB ,16:35 MIN , THEORY

Chapter 1 : Linked List
Topic : Two way Linked List, Traversing a Two way Linked List, Searching in a Two way linked List, Insertion of an element in Two way Linked List, Deleting a node from Two way Linked List,
Content : Two way Linked List, Traversing a Two way Linked List, Searching in a Two way linked List, Insertion of an element in Two way Linked List, Deleting a node from Two way Linked List, 59 MB ,30:28 MIN , THEORY + PRACTICAL

Chapter 1 : STACK
Topic : Introduction, Operations on the Stack
Content : Explanation 44 MB ,26:14 MIN , THEORY

Chapter 1 : STACK
Topic : Memory Representation of Stack, Array Representation of Stack, Applications of Stack
Content : Explanation 27 MB ,15:26 MIN , THEORY

Chapter 1 : STACK
Topic : Evaluation of Arithmetic Expression, Matching Parenthesis, infix and postfix operations
Content : Explanation 51 MB ,25:55 MIN , THEORY

Chapter 2 : Queue
Topic : QUEUE
Content : Introduction to Queue 8 MB ,4:34 MIN , THEORY

Chapter 2 : Queue
Topic : Operations on The Queue
Content : Operations on The Queue 51 MB ,31:0 MIN , THEORY

Chapter 2 : Queue
Topic : Memory Representation of Queue
Content : Explanation 41 MB ,24:34 MIN , THEORY

Chapter 2 : Queue
Topic : Some Special Kind of Queue
Content : Deque 10 MB ,5:45 MIN , THEORY

Chapter 2 : Queue
Topic : Circular Queue
Content : Circular Queue, Need of Circular Queue, Examples of Circular Queue, Operations, Applications of Circular Queue 44 MB ,26:24 MIN , THEORY

Chapter 2 : Queue
Topic : Priority Queue, Application of Priority Queue, Applications of Queues
Content : Priority Queue, Application of Priority Queue, Applications of Queues 31 MB ,18:36 MIN , THEORY

Chapter 1 : STACK
Topic : Matching Parenthesis
Content : Matching Parenthesis 9 MB ,5:29 MIN , THEORY

Chapter 1 : STACK
Topic : Recursion
Content : Recursion, Use of Stack in Recursion 19 MB ,11:0 MIN , THEORY + PRACTICAL

Chapter 1 : Sorting and Searching Techniques
Topic : Bubble Sort
Content : Explanation 111 MB ,1:4:23 MIN , THEORY + PRACTICAL

Chapter 1 : Sorting and Searching Techniques
Topic : Selection Sort
Content : Explanation 128 MB ,1:13:25 MIN , THEORY + PRACTICAL

Chapter 1 : Sorting and Searching Techniques
Topic : Insertion Sort
Content : Explanation 96 MB ,56:6 MIN , THEORY + PRACTICAL

Chapter 2 : Tree
Topic : Tree, Binary Tree, Properties of Binary Tree, Memory Representation of Binary Tree, Operations Performed on Binary Tree
Content : Explanation 207 MB ,1:56:9 MIN , THEORY + PRACTICAL

Chapter 1 : Sorting and Searching Techniques
Topic : Merge Sort
Content : Explanation 82 MB ,44:44 MIN , THEORY + PRACTICAL

Chapter 1 : Sorting and Searching Techniques
Topic : Sequential Search
Content : Explanation 28 MB ,16:5 MIN , THEORY + PRACTICAL

Chapter 1 : Sorting and Searching Techniques
Topic : Index Sequential Search
Content : Explanation 41 MB ,21:36 MIN , THEORY + PRACTICAL

Chapter 1 : Sorting and Searching Techniques
Topic : Binary Search
Content : Explanation 54 MB ,31:16 MIN , THEORY + PRACTICAL

Chapter 2 : Tree
Topic : Reconstruction of Binary Tree from its Traversals
Content : Explanation 54 MB ,30:58 MIN , THEORY

Chapter 2 : Tree
Topic : Binary Search Tree
Content : Explanation 18 MB ,10:55 MIN , THEORY

Chapter 2 : Tree
Topic : Operations on Binary Search Tree
Content : Explanation 45 MB ,26:36 MIN , THEORY

Chapter 2 : Tree
Topic : Huffman Algorithm
Content : Explanation 76 MB ,44:20 MIN , THEORY

Chapter 2 : Tree
Topic : Heap, Memory Representation Of Heap, Operation On Heap, Heap Sort
Content : Explanation 152 MB ,1:25:17 MIN , THEORY + PRACTICAL

Chapter 4 : Advanced Tree Structures
Topic : AVL Tree or Balanced Binary Search Tree
Content : Reasons behind the Imbalanced Binary Search Tree, Balanced Binary Search Tree or AVL Tree, Operations Or Rotations Performed on AVL Tree 49 MB ,28:17 MIN , THEORY

Chapter 4 : Advanced Tree Structures
Topic : Red Black Tree, Operations Performed on Red Black Tree
Content : Red Black Tree, Operations Performed on Red Black Tree 52 MB ,28:40 MIN , THEORY

Chapter 4 : Advanced Tree Structures
Topic : B-Tree
Content : B-Tree 15 MB ,8:40 MIN , THEORY

Chapter 4 : Advanced Tree Structures
Topic : 2-3 Tree
Content : 2-3 Tree, Operations on 2-3 Tree 34 MB ,18:58 MIN , THEORY

Chapter 1 : Hashing Techniques
Topic : Hash function, Address calculation techniques, Common hashing functions Collision resolution, Linear probing, Quadratic, Double hashing, Bucket hashing
Content : Explanation 154 MB ,1:28:10 MIN , THEORY

Chapter 2 : Graph
Topic : Adjacency Matrix Representation of Graph
Content : Explanation 47 MB ,25:45 MIN , THEORY + PRACTICAL

Chapter 2 : Graph
Topic : Introduction, Graph, Graph Terminology, Memory Representation of Graph
Content : Explanation 73 MB ,43:38 MIN , THEORY

Chapter 2 : Graph
Topic : Graph Rechability, Shortest Path Problems, Spanning Trees
Content : Explanation 52 MB ,31:42 MIN , THEORY

Chapter 2 : Graph
Topic : Operations Performed on Graph, Graph Traversal, Applications of the Graph, Reachability
Content : Graph Operations, Traversal DFS BFS, Applications 75 MB ,43:43 MIN , THEORY