Chapter 1 : Abstract Data Type
Topic : Different Data Types, different types of data structures & their classifications, Introduction to ADT, Creating user-specific ADT
Content : Explanation 45 MB ,23:17 MIN , THEORY

Chapter 1 : Abstract Data Type
Topic : Operations on Data Structures
Content : Operations on Data Structures 20 MB ,11:31 MIN , THEORY

Chapter 1 : Abstract Data Type
Topic : Arrays
Content : Single or 1D Array 16 MB ,10:26 MIN , THEORY

Chapter 1 : Abstract Data Type
Topic : Arrays
Content : Multidimensional or 2D Arrays 35 MB ,21:11 MIN , THEORY

Chapter 2 : Linked Structures
Topic : Linked Structures
Content : Introduction to Linked List 80 MB ,44:53 MIN , THEORY

Chapter 2 : Linked Structures
Topic : Advantages & Disadvantages, Applications of the Linked list, Representation of Polynomials, Storage of Sparse Arrays, Implementing other Data Structures.
Content : Explanation 30 MB ,16:35 MIN , THEORY

Chapter 2 : Linked Structures
Topic : ADT for linked list, Advantages & Disadvantages, Singly Linked List-Traversing, Searching, Prepending and Removing Nodes
Content : Explanation 97 MB ,51:5 MIN , THEORY + PRACTICAL

Chapter 2 : Linked Structures
Topic : Circular Linked List
Content : Circular Linked List 13 MB ,7:27 MIN , THEORY + PRACTICAL

Chapter 3 : Stacks
Topic : Introduction to Stack
Content : Introduction to Stack, What is Stack, Stack Operations, Stack ADT for Stack, Advantages & Disadvantages 44 MB ,26:14 MIN , THEORY

Chapter 3 : Stacks
Topic : STACK
Content : Memory Representation of STACK 26 MB ,15:26 MIN , THEORY + PRACTICAL

Chapter 2 : Linked Structures
Topic : Linked Structures
Content : Copy, Merge, Split and Reverse of Singly or One Way Linked List 50 MB ,28:12 MIN , THEORY + PRACTICAL

Chapter 3 : Stacks
Topic : Applications of stack
Content : Applications of stack like balanced delimiter, prefix to postfix notation 48 MB ,25:55 MIN , THEORY

Chapter 3 : Stacks
Topic : Applications of stack
Content : like balanced delimiter or Matching Parenthesis 9 MB ,5:29 MIN , THEORY + PRACTICAL

Chapter 3 : Stacks
Topic : Applications of stack
Content : Evaluation of Arithmetic Expression, prefix to postfix notation 48 MB ,25:55 MIN , THEORY + PRACTICAL

Chapter 2 : Linked Structures
Topic : Linked Structures
Content : Copy, Merge, Split and Reverse, Singly or One Way Linked List 50 MB ,28:12 MIN , THEORY + PRACTICAL

Chapter 3 : Stacks
Topic : Stacks Recursion
Content : Recursion 19 MB ,11:0 MIN , THEORY + PRACTICAL

Chapter 4 : Queues
Topic : Queues
Content : Introduction to Queue 8 MB ,4:34 MIN , THEORY + PRACTICAL

Chapter 4 : Queues
Topic : Queues
Content : Operations on The Queue 51 MB ,31:0 MIN , THEORY + PRACTICAL

Chapter 4 : Queues
Topic : linked representations
Content : Memory Representation of Queue using Array & Linked List 41 MB ,24:34 MIN , THEORY + PRACTICAL

Chapter 4 : Queues
Topic : Queues Circular Queue operations
Content : Circular Queue operations 44 MB ,26:24 MIN , THEORY + PRACTICAL

Chapter 4 : Queues
Topic : Dequeues, applications of queue like job scheduling queue
Content : Dequeues 10 MB ,5:45 MIN , THEORY + PRACTICAL

Chapter 4 : Queues
Topic : Priority Queue
Content : Priority Queue Applications of Priority Applications of Queue 31 MB ,18:36 MIN , THEORY + PRACTICAL

Chapter 1 : Doubly Linked list
Topic : Doubly Linked list
Content : ADT of doubly linked list, Advantages & Disadvantages, Insertion and deletion of nodes at various positions 59 MB ,30:28 MIN , THEORY + PRACTICAL

Chapter 2 : Trees
Topic : Implementation and Traversals
Content : Reconstruction of Binary Tree from its Traversals, 54 MB ,30:58 MIN , THEORY + PRACTICAL

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

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

Chapter 2 : Trees
Topic : Balanced BST, AVL Trees
Content : Balanced Binary Search Tree, AVL Trees 49 MB ,28:17 MIN , THEORY + PRACTICAL

Chapter 2 : Trees
Topic : Applications of Tree like Huffman Coding
Content : Huffman Algorithm using Binary Tree 76 MB ,44:20 MIN , THEORY

Chapter 2 : Trees
Topic : Trees: ADT for Tree Structure. Advantages & disadvantages, Binary Tree Properties
Content : Tree, Binary Tree, Properties of Binary Tree, Memory Representation of Binary Tree, Operations Performed on Binary Tree, 207 MB ,1:56:9 MIN , THEORY + PRACTICAL

Chapter 3 : Priority Queues & Heaps
Topic : Priority Queue
Content : Priority Queue, Priority Queue ADT, Advantages and Disadvantages, Applications 31 MB ,18:36 MIN , THEORY + PRACTICAL

Chapter 3 : Priority Queues & Heaps
Topic : Heaps, types of heaps, Heapifying the element
Content : Heap, Binary Heap, Operations on Heap, Heap Sort, Heapify 152 MB ,1:25:17 MIN , THEORY + PRACTICAL

Chapter 1 : Graph
Topic : Introduction, Graph ADT, Advantages and Disadvantages, Graph Representation using adjacency matrix and adjacency list,
Content : Introduction, Graph, Graph Terminology, Memory Representation of Graph, Adjacency Matrix Representation of Graph, Adjacency List or Linked Representation of Graph, 73 MB ,43:38 MIN , THEORY

Chapter 1 : Graph
Topic : Graph operations like insertion and deletion of nodes, Graph Traversals using BFS & DFS,
Content : Operations Performed on Graph, Graph Traversal, Applications of the Graph, 75 MB ,43:43 MIN , THEORY

Chapter 1 : Graph
Topic : Applications of Graphs like shortest path algorithms,
Content : Reachability, Shortest Path Problems, Spanning Trees. 52 MB ,31:42 MIN , THEORY

Chapter 2 : Hashing
Topic : Hashing
Content : Hash Table ADT, Advantages & Disadvantages, Concept of hashing, hash table, hash functions, collision, collision avoidance techniques, Applications of hashing 154 MB ,1:28:10 MIN , THEORY