CS 401 / MCS 401 - Computer Algorithms I
University of Illinois - Chicago
Spring 2025

This course will cover the important principles behind the design and analysis of computer algorithms. We will study techniques such as divide-and-conquer, dynamic programming, and greedy methods, as well as algorithms for sorting, searching, graph computations, and pattern matching. We will also discuss the theory of NP-completeness.

Basic Information

Syllabus: pdf
Time and Location: M-W-F 9:00–9:50am, 180G Thomas Beckham Hall (TBH)
Instructor: Lev Reyzin, SEO 417
TA/Grader: TBA
Textbook: J. Kleinberg and É. Tardos, Algorithm Design, 1st edition
Instructor's Office Hours: TBD
TA/Grader Office Hours: TBD
Piazza site: please sign up via this link

Exam Dates

midterm exam: final exam:

Problem Sets

Lectures and Readings

Note: lectures will have material not covered in the readings.