Assignments

Many of the assignments are gratefully based on materials from Brent Heeringa.

Activities/Lectures

Suggested readings are in italics. K&T refers to Algorithm Design by Kleinberg and Tardos.

Introduction to Algorithms

Graphs

Greedy Algorithms

Exam 1

Divide and Conquer

Dynamic Programming

Network flow

Amortized analysis

Exam 2

Intractability

Strings, matching, and linear sorting

Final exam