-
ABOUT THE COURSE 0
No items in this section -
[DSA] Introduction 6
-
Introducton 08 minLecture2.1
-
Types Of Data Structures 06 minLecture2.2
-
Operations Of Data Structures 06 minLecture2.3
-
Concept Of Abstract Data Type 06 minLecture2.4
-
Arrays – Part 1 16 minLecture2.5
-
Arrays – Part 2 19 minLecture2.6
-
-
[DSA] Stacks 4
-
Introduction To Stack 04 minLecture3.1
-
Operations Of Stack ADT 06 minLecture3.2
-
Stack Implementation Using Array Part – 1 10 minLecture3.3
-
Stack Implementation Using Array Part – 2 12 minLecture3.4
-
-
[DSA] Queues 6
-
Operations Of Queue ADT 04 minLecture4.1
-
Introduction Of Queue 04 minLecture4.2
-
Queue Implementation Using Array Part – 1 11 minLecture4.3
-
Queue Implementation Using Array Part – 2 09 minLecture4.4
-
Circular Queue Implementation Part – 1 12 minLecture4.5
-
Circular Queue Implementation Part – 2 09 minLecture4.6
-
-
[DSA] Linked Lists 18
-
Introduction To Linked List 05 minLecture5.1
-
Array Vs Linked List 07 minLecture5.2
-
Linked List Implementation Part – 1 17 minLecture5.3
-
Linked List Implementation Part – 2 10 minLecture5.4
-
Linked List Implementation Part – 3 10 minLecture5.5
-
Linked List Implementation Part – 4 14 minLecture5.6
-
Linked List Implementation Part – 5 09 minLecture5.7
-
Linked List Implementation Part – 6 10 minLecture5.8
-
Stack Implementation Using Linked List – Part 1 09 minLecture5.9
-
Stack Implementation Using Linked List – Part 2 06 minLecture5.10
-
Queue Using Linked List Part – 1 10 minLecture5.11
-
Queue Using Linked List Part – 2 07 minLecture5.12
-
Circular Queue Using Linked List 10 minLecture5.13
-
Doubly Linked List – Part 1 14 minLecture5.14
-
Doubly Linked List – Part 2 08 minLecture5.15
-
Doubly Linked List – Part 3 10 minLecture5.16
-
Doubly Linked List – Part 4 10 minLecture5.17
-
Doubly Linked List – Part 5 12 minLecture5.18
-
-
[DSA] Trees 14
-
Introduction to Tree Data Structure & Binary Tree 06 minLecture6.1
-
Binary Tree Implementation Part 1 – Insertion & Traversing 14 minLecture6.2
-
Binary Tree Implementation Part 2 – Traversing & Deletion 12 minLecture6.3
-
Binary tree Traversal 14 minLecture6.4
-
Tree traversal methods: Pre, post and in-order traversal 14 minLecture6.5
-
(Binary Search Tree) – Traverse the Tree in In-Order, Pre-Order and Post-Order 11 minLecture6.6
-
Height Balaced Binary Search Tree 12 minLecture6.7
-
AVL Tree 16 minLecture6.8
-
AVL Tree Solved Example – #1 17 minLecture6.9
-
AVL Tree Solved Example – #2 17 minLecture6.10
-
B-Tree Introduction 13 minLecture6.11
-
B-Tree Solved Example – #1 14 minLecture6.12
-
B-Tree Solved Example – #2 12 minLecture6.13
-
Huffman Coding 07 minLecture6.14
-
-
[DSA] Graphs 5
-
Graphs Introduction 13 minLecture7.1
-
BFS & DFS – #1 14 minLecture7.2
-
BFS & DFS – #2 12 minLecture7.3
-
Topological Sorting 11 minLecture7.4
-
Topological Sorting – Solved Example 09 minLecture7.5
-
-
[DSA] Recursion and Storage Management 5
-
Linear Search 05 minLecture8.1
-
Binary Search 11 minLecture8.2
-
Recursion – Winding & Unwinding 12 minLecture8.3
-
Introduction to Buddy System 10 minLecture8.4
-
Problems on Buddy System 08 minLecture8.5
-
-
[DSA] Searching & Sorting 18
-
Hashing Collision 12 minLecture9.1
-
Hashing concept 06 minLecture9.2
-
Linear Probing – #1 13 minLecture9.3
-
Linear Probing – #2 12 minLecture9.4
-
Linear Probing With Collisions – Solved 10 minLecture9.5
-
Linear + Quadratic Probing – Solved Example 15 minLecture9.6
-
Searching & Sorting Introduction 12 minLecture9.7
-
Selection Sorting – #1 12 minLecture9.8
-
Selection Sorting – #2 12 minLecture9.9
-
Insertion Sort – #1 12 minLecture9.10
-
Insertion Sort – #2 12 minLecture9.11
-
Merge Sort – #1 12 minLecture9.12
-
Merge Sort – #2 12 minLecture9.13
-
Merge Sort – #3 10 minLecture9.14
-
Quick Sort – #1 10 minLecture9.15
-
Quick Sort – #2 09 minLecture9.16
-
Radix Sort – #1 10 minLecture9.17
-
Radix Sort – #2 10 minLecture9.18
-
-
[DSA] Applications of Data Structures 6
-
Heap Data Structure 11 minLecture10.1
-
Min & Max Heap 12 minLecture10.2
-
Infix Notation & Conversion 11 minLecture10.3
-
Prefix, Postfix Notation & Conversion 12 minLecture10.4
-
Prim’s & Kruskal’s #1 19 minLecture10.5
-
Prim’s & Kruskal’s #2 10 minLecture10.6
-
-
[DSA] Viva Questions 1
-
Viva Questions – Data StructuresLecture11.1
-
-
[DSA] MU - Dec-2024 Importance Solutions 6
-
[Soln] Mod 1 – Stack, Queue & Linked ListLecture12.1
-
[Soln] Mod 2 – TreesLecture12.2
-
[Soln] Mod 3 – GraphsLecture12.3
-
[Soln] Mod 4 – Recursion & Storage ManagementLecture12.4
-
[Soln] Mod 5 – Searching & SortingLecture12.5
-
[Soln] Mod 6 – Application Of Data StructuresLecture12.6
-
This content is protected, please login and enroll course to view this content!

