CSCI 256 - Fall 2026
Algorithm Design and Analysis
Home | Lectures | Problem Sets | Handouts | CS@Williams
Lectures
Links to lecture slides will be available after class.
In the readings, KT refers to the Kleinberg-Tardos textbook, whereas E refers to Erickson. When readings from both are suggested there will generally be some overlap between the two textbooks; students are not expected to read both.
| Date | Lecture | Reading | Exercise |
| Sep 11 | Welcome & Overview | N/A | Exercise 1 |
| Sep 14 | Stable Matchings | KT 1.1 & 2.2 | Exercise 2 |
| Sep 16 | Asymptotic Analysis | KT 2.2 & 2.3 | Exercise 3 |
| Sep 18 | Stable Matching Wrap Up | KT 2.2 & 2.3 | Exercise 4 |
| Sept 21 | Graphs & BFS | KT 3.1-3.3 | N/A |
| Sept 23 | Depth-first Search | KT 3.2 & 3.3 | Exercise 5 |
| Sept 25 | DAGs & Topological Sorting | KT 3.5 | Exercise 6 |
| Sept 28 | Dijkstra's Algorithm | KT 4.4 | Exercise 7 |
| Sept 30 | Priority Queues | KT 2.5 | Exercise 8 |
| Oct 2 | Minimum Spanning Trees | KT 4.5 | Exercise 9 |
| Oct 5 | In Class Test | N/A | |
| Oct 7 | Union-Find Data Structure | KT 4.6 | |
| Copyright 2026 | Department of Computer Science :: 47 Lab Campus Drive :: Williamstown, MA 01267 |