| WEEK | TOPIC | READING |
| 1 | Basic Concepts | Ch. 1, 2 |
| 2 | Growth of Functions | Ch. 3, 4 |
| 3 | Probabilistic Analysis | Ch. 5 |
| 4 | Sorting (1) | Ch. 6 |
| 5 | Sorting (2) | Ch. 7, 8 |
| 6 | Linear Structures and Hash Tables | Ch. 10, 11 |
| 7 | Mid-term exam, 5:30 - 7:30 pm | |
| 8 | Binary Search Trees | Ch. 12 |
| 9 | Self-balancing BST | Ch. 13, 17 |
| 10 | B-trees and Amortized Analysis | Ch. 18, 16 |
| 11 | Dynamic Programming | Ch. 14 |
| 12 | Greedy Algorithms | Ch. 15 |
| 13 | Graphs (1) | Ch. 20 |
| 14 | Graphs (2) | Ch. 21, 22, 23 |
| Final exam: Dec. 17, 5:30 - 7:30 pm |