Data Structures And Analysis – Sem-3 IT
₹39,999.00
₹29,999.00
-
ABOUT THE COURSE
-
[DSA] Introduction
-
[DSA] Stacks
-
[DSA] Queues
-
[DSA] Linked Lists
- Introduction To Linked List
- Array Vs Linked List
- Linked List Implementation Part – 1
- Linked List Implementation Part – 2
- Linked List Implementation Part – 3
- Linked List Implementation Part – 4
- Linked List Implementation Part – 5
- Linked List Implementation Part – 6
- Stack Implementation Using Linked List – Part 1
- Stack Implementation Using Linked List – Part 2
- Queue Using Linked List Part – 1
- Queue Using Linked List Part – 2
- Circular Queue Using Linked List
- Doubly Linked List – Part 1
- Doubly Linked List – Part 2
- Doubly Linked List – Part 3
- Doubly Linked List – Part 4
- Doubly Linked List – Part 5
-
[DSA] Trees
- Introduction to Tree Data Structure & Binary Tree
- Binary Tree Implementation Part 1 – Insertion & Traversing
- Binary Tree Implementation Part 2 – Traversing & Deletion
- Binary tree Traversal
- Tree traversal methods: Pre, post and in-order traversal
- (Binary Search Tree) – Traverse the Tree in In-Order, Pre-Order and Post-Order
- Height Balaced Binary Search Tree
- AVL Tree
- AVL Tree Solved Example – #1
- AVL Tree Solved Example – #2
- B-Tree Introduction
- B-Tree Solved Example – #1
- B-Tree Solved Example – #2
- Huffman Coding
-
[DSA] Graphs
-
[DSA] Recursion and Storage Management
-
[DSA] Searching & Sorting
- Hashing Collision
- Hashing concept
- Linear Probing – #1
- Linear Probing – #2
- Linear Probing With Collisions – Solved
- Linear + Quadratic Probing – Solved Example
- Searching & Sorting Introduction
- Selection Sorting – #1
- Selection Sorting – #2
- Insertion Sort – #1
- Insertion Sort – #2
- Merge Sort – #1
- Merge Sort – #2
- Merge Sort – #3
- Quick Sort – #1
- Quick Sort – #2
- Radix Sort – #1
- Radix Sort – #2
-
[DSA] Applications of Data Structures
-
[DSA] Viva Questions
-
[DSA] MU - Dec-2024 Importance Solutions