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 and Course Overview N/A Exercise 1

Sep 14 Stable Matching and Big Oh KT 1.1 & 2.2

Sep 16 Graphs and BFS KT 2.3 & 3.1

Sep 18 BFS Applications KT 3.3-3.4

Copyright 2026 | Department of Computer Science :: 47 Lab Campus Drive :: Williamstown, MA 01267