| Date | Day | Lecture | Topic | Reading | Due |
| 31-Aug | Thu | 1 | Introduction & Order of Growth | 1.1-2.2 | |
| 5-Sep | Tue | 2 | Summations & Analysis of Loop Algorithms | 3.1-3.2 | |
| 7-Sep | Thu | 3 | Recurrences & Analysis of Recursive Algorithms | 4.1-4.2 | HW 1 Due |
| 12-Sep | Tue | 4 | The Master Theorem | 4.3 | |
| 14-Sep | Thu | 5 | Sorting I: Heapsort | 7.1-7.5 | HW 2 Due |
| 19-Sep | Tue | 6 | Sorting II: Quicksort | 8.1-8.4 | |
| 21-Sep | Thu | 7 | Sorting III: Lower Bounds & Linear Sorting | 9.1-9.4 | HW 3 Due |
| 26-Sep | Tue | 8 | Order Statistics | 10.1-10.3 | |
| 28-Sep | Thu | 9 | Exam I | ||
| 3-Oct | Tue | 10 | Exam I Discussion | ||
| 5-Oct | Thu | 11 | Hashing I | 12.1-12.2 | HW 4 Due |
| 10-Oct | Tue | 12 | Hashing II | 12.3-12.4 | |
| 12-Oct | Thu | 13 | Red-Black Trees | 14.1-14.4 | HW 5 Due |
| 17-Oct | Tue | 14 | Dynamic Programming | 16.1-16.2 | |
| 19-Oct | Thu | 15 | Dynamic Programming | 16.3-16.4 | HW 6 Due |
| 24-Oct | Tue | 16 | Dynamic Programming | ||
| 26-Oct | Thu | 17 | Union-Find & Disjoint Sets | 22.1-22.3 | HW 7 Due |
| 31-Oct | Tue | 18 | Graphs, Breadth-First & Depth-First Search | 23.1-23.3 | |
| 2-Nov | Thu | 19 | Topological Sorting & Connected Components | 23.3-23.4 | HW 8 Due |
| 7-Nov | Tue | 20 | Exam II | ||
| 9-Nov | Thu | 21 | Exam II Discussion | ||
| 14-Nov | Tue | 22 | Minimum Spanning Trees | 24.1-24.2 | |
| 16-Nov | Thu | 23 | Single Source Shortest Paths I | 25.1-25.2 | HW 9 Due |
| 21-Nov | Tue | 24 | Single Source Shortest Paths I | 25.3-25.4 | |
| 23-Nov | Thu | Thanksgiving Break | |||
| 28-Nov | Tue | 25 | All-Pairs Shortest Paths I | 26.1-26.2 | HW 10 Due |
| 30-Nov | Thu | 26 | All-Pairs Shortest Paths II | 26.3 | |
| 5-Dec | Tue | 27 | Greedy Algorithms | 17.1-17.3 | HW 11 Due |
| 7-Dec | Thu | 28 | Special Topic TBA | ||
| 12-Dec | Tue | 29 | Review | Project Due | |
| 13-Dec | Wed | Last Day Of Classes | |||
| 21-Dec | Thu | Final Exams |