CS 7800 — Advanced Algorithms
4 semester hoursGraduateLectureusually offered: falltypical days: M/ThBostonTraditional
Presents advanced mathematical techniques for designing and analyzing computer algorithms. Reviews some of the material covered in CS 5800 and then covers advanced topics. Emphasizes theoretical underpinnings of techniques used to solve problems arising in diverse domains. Topics include asymptotic analysis, advanced data structures, dynamic programming, greedy algorithms and matroid theory, amortized analysis, randomization, string matching, algebraic algorithms, and approximation algorithms. Introduces Turing machines, P and NP classes, polynomial-time reducibility, and NP completeness.
Offering history
| Term | Sections | Enrolled | Capacity | Full | Open seats/section |
|---|---|---|---|---|---|
| Fall 2023 | 1 | 14 | 39 | 36% | 25.0 |
| Fall 2024 | 1 | 17 | 30 | 57% | 13.0 |
| Spring 2025 | 1 | 6 | 15 | 40% | 9.0 |
| Fall 2025 | 1 | 11 | 30 | 37% | 19.0 |
Snapshots from scheduled scrapes — not live seat availability. "Full" can exceed 100% when sections over-enroll.
Meeting times
Share of recent sections by weekday: M 70% · T 30% · W 16% · Th 54% · F 30%
Common patterns: MR (54% of sections), TF (30% of sections), MW (16% of sections) — in patterns, R means Thursday
Professors
Fall
- Huy Nguyen (74% of students) · reviews
- Jonathan Ullman (26% of students) · reviews
Spring
- Prashant Pandey (60% of students) · reviews
- Soheil Behnezhad (40% of students) · reviews
Percentages are each professor's average share of the season's enrolled students in recent terms.
Unlocks
CS 5350, CS 6140, CS 6220, CS 6240, CS 7805, CS 7870
Courses that list CS 7800 in their prerequisites.
Links
Official catalog (CS course descriptions) · Student reviews on RateMyHusky · All CS courses · Plan it at numap.app