|
Week - 1 |
Introduction to Linear Data Structures and Basic Operations (Max/Min, Insertion, Deletion) |
|
Week - 2 |
Basic Sorting Algorithms (Bubble, Selection, Insertion, Shell Sort) and Reversal |
|
Week - 3 |
Linear Search and Binary Search Algorithms |
|
Week - 4 |
Linked Lists I: Singly (Unidirectional) and Doubly Linked Lists |
|
Week - 5 |
Linked Lists II: Circular Linked Lists, Stack and Queue Structures |
|
Week - 6 |
Recursive Algorithms and Classical Problems (Fibonacci, Towers of Hanoi) |
|
Week - 7 |
Recursive Algorithms and Classical Problems (Fibonacci, Towers of Hanoi) |
|
Week - 8 |
Binary Search Trees (BST), Tree Traversal Methods and Node Operations |
|
Week - 9 |
Binary Heap Sort and Hash Tables |
|
Week - 10 |
Graph Theory, Depth-First Search (DFS) and Breadth-First Search (BFS) |
|
Week - 11 |
Topological Sorting in Directed Graphs and Dijkstra’s Algorithm |
|
Week - 12 |
State Space and Search Simulations: Rat in a Maze and Eight Coins Problem |
|
Week - 13 |
Dynamic Programming and Optimization: Knapsack Problem |
|
Week - 14 |
Circular Data Modeling: Josephus Problem |