Introduction to the theory of computing, covering finite automata, computability, and complexity theory.
Offering recorded · Fall 2026
Workload is heavy with weekly homeworks requiring significant time, and grading can be inconsistent, with some finding tests difficult despite easy homework.
Introduction to efficient algorithm design paradigms and analysis of computational intractability.
Offering recorded · Fall 2026
The course is consistently described as hard, requiring significant extra time outside of class. Workload includes challenging homeworks and a stressful final exam that varies in difficulty, with grading often relying on participation or bonus points.
COMPSCI 638 covers selected topics in computing, with content varying by instructor and offering.
Offering recorded · Fall 2026
Historical reviews of Deborah Joseph, Laura Legault, Remzi Arpaci-Dusseau: Reviewers describe the course as generally easy, though one instructor is noted for requiring outside-the-box thinking.
COMPSCI 787 covers advanced algorithm design and analysis, focusing on randomness, linear programming, and semi-definite programming for optimization and distributed problems.
Offering recorded · Fall 2026
The course is mathematically rigorous with heavy proof requirements, though one historical review notes an average workload of two homeworks and one exam under a different instructor.