1. Introduction to Data Structures
- What is Data Structure?
- Types of Data Structures (Linear & Non-Linear)
- Time & Space Complexity
- Big-O Notation
2. Arrays
- Memory Representation
- Traversing, Insertion, Deletion
- Searching (Linear & Binary Search)
- Sorting (Bubble, Selection, Insertion)
- 2D Arrays
3. Strings
- String Operations
- Palindrome Check
- Frequency Count
4. Recursion
- Recursive vs Iterative
- Factorial & Fibonacci
- Tower of Hanoi (Conceptual)
5. Stack
- Array & Linked List Implementation
- Push, Pop, Peek
- Applications (Balanced Parentheses, Infix to Postfix)
6. Queue
- Array & Linked List Implementation
- Circular Queue & Deque
- Applications (Scheduling, Simulation)
7. Linked List
- Singly, Doubly, Circular
- Insertion & Deletion
- Reversing & Loop Detection
8. Trees
- Binary Tree & BST
- Tree Traversals (Inorder, Preorder, Postorder)
- Insertion & Deletion in BST
- Height of Tree
9. Advanced Sorting
- Merge Sort
- Quick Sort
10. Graphs
- Adjacency Matrix & List
- BFS & DFS
- Applications
11. Hashing
- Hash Functions
- Collision Handling (Chaining, Linear Probing)
12. Final Practice & Mini Project
- Student Record System
- Library Management System
- Interview Preparation & Mock Test