Announcements
The schedule below is tentative and is subject to change. Make sure to check back for the latest version!
| WEEK | DAY | ANNOUNCEMENTS | TOPIC & RECOMMENDED READING | LABS & HW |
|---|---|---|---|---|
| 1 | Sep 01 | — | Course intro Stable matching Reading: Chapter 1 | Lab 1 |
Sep 03 | — | |||
| 2 | Sep 08 | — | No Lab (Labor Day) HW 1 git setup LearningLaTeX.tex | |
Sep 10 | Drop/add ends (Sep 14) | Analysis Reading: Chapters 2.1–2.4 | ||
| 3 | Sep 15 | — | Lab 2 | |
Sep 17 | — | |||
| 4 | Sep 22 | — | Graph Algorithms Reading: Chapter 3 | Lab 3 HW 2 |
Sep 24 | — | |||
| 5 | Sep 29 | — | — | |
Oct 01 | Final Exam Date Announced | Greedy Algorithms Reading: Chapter 4 | ||
| 6 | Oct 06 | — | ||
Oct 08 | — | Divide and Conquer Reading: Chapter 5 | ||
| — | Oct 13 | Fall Break | ||
Oct 15 | ||||
| 7 | Oct 20 | — | Divide and Conquer Reading: Chapter 5 (continued) | |
Oct 22 | Midterm Exam | |||
| 8 | Oct 27 | — | Dynamic Programming Reading: Chapter 6.1–6.5 | |
Oct 29 | — | |||
| 9 | Nov 03 | — | Intractability Reading: Chapter 8.1–8.4 | |
Nov 05 | CR/NC/W Deadline (Nov 06) | |||
| 10 | Nov 10 | — | ||
Nov 12 | — | |||
| 11 | Nov 17 | — | Approximation Algorithms Reading: Chapter 11.1–11.4,11.6,11.8 | |
Nov 19 | — | Randomized Algorithms Reading: Chapter 13.1–13.5 | ||
| 12 | Nov 24 | — | ||
Nov 26 | Thanksgiving | |||
| 13 | Dec 01 | — | Network Flow Reading: Chapter 7.1–7.3,7.5,7.9 | |
Dec 03 | — | |||
| 14 | Dec 08 | — | TBD | |
Dec 13 | Final Exams Begin | |||
| — | Dec 19 | |||