CS 401 / MCS 401 - Computer Algorithms I
University of Illinois - Chicago
Fall 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 2:00–2:50pm, 180G Thomas Beckham Hall (TBH)
Instructor: Lev Reyzin, SEO 417
Instructor's Office Hours: TBD
TA/Grader: TBD
TA/Grader Office Hours: TBD
Textbook: J. Kleinberg and É. Tardos, Algorithm Design, 1st edition
Piazza site: please sign up via this link

Exam Dates

midterm exam 1: TBD
midterm exam 2: TBD
final exam: 1:00am-3:00pm on Wednesday 12/19/25

Problem Sets

Lectures and Readings

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

Lecture 1 (8/25/25)
covered material: intro to the course, overview of covered material, introduction to stable marriage problem
reading: preface