CSOR 4231Section 002Fall 20263 creditsAlmost full
Analysis of Algorithms I
Call number
Monday and Wednesday
2:40pm–3:55pm
COMPUTER SCIENCE BLDG CSC 451
Seat data provenance: Directory as of August 23, 2026 at 4:00 AM
Description
Lect: 3. Introduction to the design and analysis of efficient algorithms. Topics include models of computation, efficient sorting and searching, algorithms for algebraic problems, graph algorithms, dynamic programming, probabilistic methods, approximation algorithms, and NP-completeness.
Reviews
Course experience
Aggregated across everyone who has taught this course.
No reviews matched yet.
Instructor quality
n=17, 2006–2025
Aggregated across every course Mihalis Yannakakis has taught.
Teaching quality
4.4 / 5
Grading fairness
4.5 / 5
Workload
4.5 / 5 · Very heavy
Difficulty
3.4 / 5 · Moderate
In your week
Mon7
Wed2
Where it meets
Flat map — motion reduced