-
Course Overview 0
No items in this section -
Data Structures [ Module 1]:- Introduction To Data Structures 6
-
Introduction of Data Structure 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
-
Array Part #1 16 minLecture2.5
-
Array Part #2 19 minLecture2.6
-
-
Data Structures [ Module 2]:- Stack & Queues 10
-
Introduction To Stack 05 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
-
Introduction Of Queue 05 minLecture3.5
-
Operations Of Queue ADT 04 minLecture3.6
-
Queue Implementation Using Array Part #1 11 minLecture3.7
-
Queue Implementation Using Array Part #2 09 minLecture3.8
-
Circular Queue Implementation Part #1 12 minLecture3.9
-
Circular Queue Implementation Part #2 08 minLecture3.10
-
-
Data Structures [ Module 3]:- Linked List 18
-
Introduction To Linked Lists 06 minLecture4.1
-
Array Vs Linked List 08 minLecture4.2
-
Linked List Implementation Part #1 17 minLecture4.3
-
Linked List Implementation Part #2 11 minLecture4.4
-
Linked List Implementation Part #3 10 minLecture4.5
-
Linked List Implementation Part #4 15 minLecture4.6
-
Linked List Implementation Part #5 11 minLecture4.7
-
Linked List Implementation Part #6 10 minLecture4.8
-
Stack Using Linked List Part #1 09 minLecture4.9
-
Stack Using Linked List Part #2 06 minLecture4.10
-
Queue Using Linked List Part #1 10 minLecture4.11
-
Queue Using Linked List Part #2 06 minLecture4.12
-
Circular Queue Using Linked List 09 minLecture4.13
-
Doubly Linked List #1 13 minLecture4.14
-
Doubly Linked List #2 08 minLecture4.15
-
Doubly Linked List #3 09 minLecture4.16
-
Doubly Linked List #4 10 minLecture4.17
-
Doubly Linked List #5 12 minLecture4.18
-
-
Data Structures [ Module 4]:- Trees 4
-
Introduction To Tree Data Structure & Binary Tree 06 minLecture5.1
-
Binary Tree – Insertion & Traversing 14 minLecture5.2
-
Binary Tree – Traversing & Deletion 12 minLecture5.3
-
Huffman Coding 07 minLecture5.4
-
-
Data Structures [ Module 5]:-Graphs 2
-
BFS ( Breadth First Search ) Algorithm 05 minLecture6.1
-
DFS ( Depth First Search ) Algorithm 03 minLecture6.2
-
-
Data Structures [ Module 6]:- Searching Techniques 4
-
Linear Search 05 minLecture7.1
-
Binary Search 11 minLecture7.2
-
Hashing Concept 06 minLecture7.3
-
Hashing Collision 12 minLecture7.4
-
-
Data Structures [Notes] :- 7
-
Introduction to Data Structures & Algorithms.Lecture8.1
-
StacksLecture8.2
-
Sorting & SearchingLecture8.3
-
QueueLecture8.4
-
Linked ListLecture8.5
-
TreesLecture8.6
-
GraphLecture8.7
-
-
Data Structures [Viva Question]:- 6
-
Introduction to Data StructuresLecture9.1
-
Stack and QueuesLecture9.2
-
TreesLecture9.3
-
Linked ListLecture9.4
-
GraphsLecture9.5
-
Searching TechniquesLecture9.6
-
-
Data Structures [ IMPs ]:- 7
-
Introduction to Data StructuresLecture10.1
-
Stack and QueuesLecture10.2
-
Linked ListLecture10.3
-
TreesLecture10.4
-
GraphsLecture10.5
-
Searching TechniquesLecture10.6
-
[Extra] Previously Asked Important QuestionsLecture10.7
-
This content is protected, please login and enroll course to view this content!
Prev
Hashing Collision
Next
Stacks

