Under "topic", the lecture notes are linked. Under "reading", all references are to the required textbook.
| WEEK | DATE | TOPIC | READING |
| 1 | 01/17 | Algorithm Analysis | Ch. 1, 2 |
| 2 | 01/24 | Growth of Functions | Ch. 3, 4 |
| 3 | 01/31 | Probabilistic Analysis | Ch. 5 |
| 4 | 02/07 | Sorting | Ch. 6 |
| 5 | 02/14 | Sorting | Ch. 7, 8 |
| 6 | 02/21 | Linear Data Structures | Ch. 10, 11 |
| 7 | 02/28 | mid-term exam | |
| 8 | 03/07 | Spring recess | |
| 9 | 03/14 | Binary Search Trees | Ch. 12 |
| 10 | 03/21 | Dynamic Programming | Ch. 15 |
| 11 | 03/28 | Greedy Algorithms | Ch. 16 |
| 12 | 04/04 | Graphs | Ch. 22, 23 |
| 13 | 04/11 | Graphs | Ch. 24, 25 |
| 14 | 04/18 | Hard Problems | Ch. 34, 35 |
| 15 | 04/25 | Course Review | |
| 16 | 05/02 | study day | |
| 17 | 05/09 | final exam |