| WEEK | DATE | TOPIC | READING |
| 1 | 1/19 | Basic Concepts | Chapters 1-4 |
| 2 | 1/26 | Divide-and-Conquer on Linear Data Structures | Sections 7.1-7.2, 7.4.1; Chapter 8; Sections 10.1-3; Chapter 11 |
| 3 | 2/02 | Probabilistic Analysis and Randomized Algorithms | Chapter 5; Sections 7.3, 7.4.2 |
| 4 | 2/09 | Median and Order Statistics | Chapter 9 |
| 5 | 2/16 | Algorithms on Trees | Section 10.4; Chapters 6, 12-14, 18 |
| 6 | 2/23 | Dynamic Programming and Memoization | Chapter 15 |
| 7 | 3/02 | Mid-term Examination | |
| - | 3/09 | Spring recess | |
| 8 | 3/16 | Greedy Algorithms | Chapter 16 |
| 9 | 3/23 | Amortized Analysis | Chapter 17 |
| 10 | 3/30 | Graph: Structure Exploration | Chapters 22 |
| 11 | 4/06 | Graph: Optimization | Chapters 23-25 |
| 12 | 4/13 | Linear Programming | Sections 26.1-2; Chapter 29 |
| 13 | 4/20 | Tractability and Approximation | Chapters 34-35 |
| 14 | 4/27 | Summary and Beyond | |
| - | 5/04 | study day | |
| - | 5/11 | Final Examination (5:45-7:45) |