| Days | Content Title | Key Concepts Covered |
| Days 1-7 | Basic Structures & Analysis | Introduction to Algorithms, Time and Space Complexity (Big O), Arrays and Linked Lists (Singly, Doubly). |
| Days 8-14 | Linear Data Structures | Stacks (LIFO), Queues (FIFO), Implementation using Arrays and Linked Lists, Hash Tables/Maps. |
| Days 15-21 | Non-Linear Structures I | Trees (Binary Trees, Binary Search Trees), Tree Traversal (Inorder, Preorder, Postorder). |
| Days 22-30 | Non-Linear Structures II & Project | Introduction to Graphs (DFS, BFS), Sorting Algorithms (Selection, Bubble, Merge), Final Project: Implement a Simple Pathfinding Algorithm using a Graph. |
Reviews
There are no reviews yet.