CSE 202Combinatorial Algorithms
Fundamental combinatorial algorithms, graph algorithms, flow problems, matching problems, linear programming, integer programming, NP-completeness, approximation algorithms for optimization problems. (Formerly Computer Science 211.)
Prerequisites
Prerequisite(s): CSE 201.
Find a section and add it to your scheduleLive seat counts, time-conflict checks and the walk from your previous class.
When it runs
Winter 2027Open Winter 2027
| Section | Type | When | Where | Instructor | Seats |
|---|---|---|---|---|---|
| 01 | Lecture | Asynchronous | — | S. Im | Open 0/42 |
Who teaches it
| Instructor | Rating | Difficulty | Would take again | Reviews |
|---|---|---|---|---|
| Sungjin Im | 4.0 / 5 | 3.4 / 5 | 67% | 8 |
From RateMyProfessors, which is student-submitted and not a survey. Small review counts move a long way on one bad quarter.
SlugAtlas is a student project and is not affiliated with, endorsed by, or operated by UC Santa Cruz. Course data is a snapshot of the public class search; myUCSC is authoritative for enrolment.