CS 5800 — Algorithms

4 semester hoursGraduateLectureNUpath FQusually offered: fall, springArlington, VABostonMiami, FLOakland, CAOnlinePortland, MaineSan Francisco, CASeattle, WASilicon Valley, CAVancouver, CanadaHybridOnlineTraditional

Presents the mathematical techniques used for the design and analysis of computer algorithms. Focuses on algorithmic design paradigms and techniques for analyzing the correctness, time, and space complexity of algorithms. Topics may include asymptotic notation, recurrences, loop invariants, Hoare triples, sorting and searching, advanced data structures, lower bounds, hashing, greedy algorithms, dynamic programming, graph algorithms, and NP-completeness.

Offering history

TermSectionsEnrolledCapacityFullOpen seats/section
Fall 202320767102575%12.9
Spring 20241363376982%10.5
Summer A 20241113234%21.0
Fall 202424860117573%13.1
Spring 20251566479883%8.9
Summer A 20251172861%11.0
Fall 202520916118877%13.6
Spring 20261670886382%9.7

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 41% · T 21% · W 22% · Th 35% · F 16%

Common patterns: MR (15% of sections), T (12% of sections), R (11% of sections), async (11% of sections), M (10% of sections), MW (9% of sections) — in patterns, R means Thursday

Professors

Fall

Spring

Summer A

Percentages are each professor's average share of the season's enrolled students in recent terms.

Unlocks

CS 5170, CS 5350, CS 6140, CS 6170, CS 6220, CS 6240, CS 7870, CS 7980, DS 5500, IE 7275

Courses that list CS 5800 in their prerequisites.

Links

Official catalog (CS course descriptions) · Student reviews on RateMyHusky · All CS courses · Plan it at numap.app