Unit 1: Algorithm Analysis — Asymptotic Notation, Recurrence Relations

Unit 2: Divide & Conquer — MergeSort, QuickSort, Binary Search

Unit 3: Greedy Algorithms — Activity Selection, Huffman Coding

Unit 4: Dynamic Programming — Memoization, Tabulation, Classic Problems

Unit 5: Graph Algorithms — Advanced BFS/DFS, Network Flow

Unit 6: NP-Completeness — P vs NP, Reductions