CS 5002 — Discrete Structures

4 semester hoursGraduateLectureusually offered: fall, springArlington, VABostonMiami, FLOakland, CAOnlinePortland, MaineSeattle, WASilicon Valley, CAVancouver, CanadaHybridLive CastOnlineTraditional

Introduces the mathematical structures and methods that form the foundation of computer science. Studies structures such as sets, tuples, sequences, lists, trees, and graphs. Discusses functions, relations, ordering, and equivalence relations. Examines inductive and recursive definitions of structures and functions. Covers principles of proof such as truth tables, inductive proof, and basic logic and the counting techniques and arguments needed to estimate the size of sets, the growth of functions, and the space-time complexity of algorithms. Also, discusses data structures such as arrays, stacks, queues, lists, and the algorithms that manipulate them.

Offering history

TermSectionsEnrolledCapacityFullOpen seats/section
Fall 20231870585582%8.3
Spring 20241018940846%21.9
Fall 20241536861160%16.2
Spring 2025612426547%23.5
Fall 20251124548051%21.4
Spring 202679523041%19.3

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 23% · T 21% · W 40% · Th 19% · F 6%

Common patterns: W (29% of sections), T (18% of sections), R (14% of sections), MW (11% of sections), M (10% of sections), async (7% 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.

Unlocks

CS 5004, CS 5008

Courses that list CS 5002 in their prerequisites.

Links

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