A comprehensive introduction to design and analysis of algorithms (covering analysis techniques such as dynamic programming and amortized analysis; graph algorithms such as minimum spanning trees and network flows; NP-completeness theory; and approximation algorithms)

Responsibilities include: weekly office hours, and grading problem sets and exams