| CPSC 320: Analysis of Algorithms | Spring 2026 |
| Week | Date | Topics | Reading | Homework/project |
| 1 | Jan. 21 | Introduction | §§1.1, 1.2 | Homework 1 |
| 2 | Jan. 26, 28 | Basics of algorithm analysis | §§2.1–2.5 | Homework 2 |
| 3 | Feb. 2, 4 | Graph traversal | §§3.1–3.4 | Homework 3 |
| 4 | Feb. 9, 11 | DAGs and topological ordering | §§3.5, 3.6 | Homework 4 |
| 5 | Feb. 16, 18 Feb. 19, 20 |
Interval scheduling Trinity Days |
§§4.1, 4.2 |
Homework 5 |
| 6 | Feb. 23, 25 | Shortest paths and minimum spanning trees | §§4.4, 4.5 | |
| 7 | Mar. 2 Mar. 4 (Wed.) |
Kruskal's and Prim's algorithms Midterm exam, in class |
§4.6 |
Research project |
| 8 | Mar. 9, 11 | Recurrence relations and counting inversions | §§5.1–5.3 | Homework 6 |
| Mar. 16–20 | Spring vacation | |||
| 9 | Mar. 23, 25 | Integer multiplication and selection | §5.5 | Homework 7 |
| 10 | Mar. 30, Apr. 1 | Dynamic programming | §§6.1, 6.2, 6.6–6.9 | Homework 8 |
| 11 | Apr. 6, 8 | Polynomial-time reductions and NP-completeness | §§8.1–8.3 | Programming project |
| 12 | Apr. 13, 15 | NP-complete problems | §§8.4–8.8 | |
| 13 | Apr. 20, 22 | Project presentations | ||
| 14 | Apr. 27 | Project presentations | ||
| May 7 (Thu.) | Final exam |
|
|
CPSC 320 home page |
|
|