CS 4810 — Advanced Algorithms
4 semester hoursUndergraduateLecturetypical days: M/WBostonTraditional
Builds on CS 3000. Presents an advanced study of computer algorithms. Covers basic algorithmic paradigms (e.g., greedy, divide-and-conquer, and dynamic programming); graph algorithms; optimization; computational Intractability (e.g., NP-completeness, PSPACE-completeness); randomized algorithms; and approximation algorithms.
Prerequisites
Offering history
| Term | Sections | Enrolled | Capacity | Full | Open seats/section |
|---|
| Fall 2023 | 1 | 6 | 10 | 60% | 4.0 |
| Spring 2026 | 1 | 8 | 20 | 40% | 12.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 100% · T 0% · W 57% · Th 43% · F 0%
Common patterns: MW (57% of sections), MR (43% of sections)
— in patterns, R means Thursday
Professors
Fall
Spring
Percentages are each professor's average share of the season's enrolled students in recent terms.
Links
Official catalog (CS course descriptions) · Student reviews on RateMyHusky · All CS courses · Plan it at numap.app