Tests
| Wed 24 Sep, | Test 1 |
| Wed 5 Nov, | Test 2 |
| Mon 15 Dec, | Final |
| (2:00pm) |
Review Questions
The review questions are indexed to the relevant sections of the textbook (after the § symbol).
| R0: Big-O notation §0.3 |
| R2: Divide-and-conquer §2.2 |
| R3: Graphs & depth-first search §3 |
| R4: Paths in graphs §4 |
| R5: Minimum spanning trees §5.1 |
| R6: Dynamic programming §6 |