CSE 201Analysis of Algorithms
Rigorous analysis of the time and space requirements of important algorithms, including worst case, average case, and amortized analysis. Techniques include order-notation, recurrence relations, information-theoretic lower bounds, adversary arguments. Analysis of the key data structures: trees, hash tables, balanced tree schemes, priority queues, Fibonacci and binomial heaps. Algorithmic paradigms such as divide and conquer, dynamic programming, union-find with path compression, augmenting paths. Selected advanced algorithms. Introduction to NP-completeness. (Formerly Computer Science 201.)
Enrollment is restricted to graduate students; undergraduate students may enroll in this course if they have completed CSE 101M or CSE 106 and have the consent of the instructor.
- Enroll in lecture and associated discussion section.
Find a section and add it to your scheduleLive seat counts, time-conflict checks and the walk from your previous class.
When it runs
Fall 2026Open Fall 2026
| Section | Type | When | Where | Instructor | Seats |
|---|---|---|---|---|---|
| 01 | Lecture | Tue Thu 11:40am–1:15pm | ClassroomUnit 001 | S. Im | Open 81/130 |
Fall 2025Open Fall 2025
| Section | Type | When | Where | Instructor | Seats |
|---|---|---|---|---|---|
| 01 | Lecture | Tue Thu 8:00am–9:35am | J Bask Aud 101 | S. Im | Open 101/120 |
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.