CS 1800 — Discrete Structures

4 semester hoursUndergraduateLectureNUpath FQusually offered: fall, spring, summertypical days: T/FBostonOakland, CAOnlineOnlineTraditional

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. Discusses principles of proof such as truth tables, inductive proof, and basic logic. Also covers the counting techniques and arguments needed to estimate the size of sets, the growth of functions, and the space-time complexity of algorithms.

Corequisites (same term)

Offering history

TermSectionsEnrolledCapacityFullOpen seats/section
Fall 202391135122992%10.4
Spring 2024323723999%0.7
Summer A 20241485096%2.0
Summer B 20241829785%15.0
Fall 20249924126173%37.4
Spring 2025318524077%18.3
Summer A 202538717849%30.3
Summer B 20251728090%8.0
Fall 2025667679086%19.0
Spring 2026313219368%20.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 12% · T 66% · W 9% · Th 5% · F 77%

Common patterns: TF (62% of sections), F (12% of sections), async (9% of sections), MW (4% of sections), T (4% of sections), MWF (3% of sections) — in patterns, R means Thursday

Professors

Fall

Spring

Summer A

Summer B

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

Unlocks

CS 2700, CS 2800, CS 3000, EECE 2310, MATH 2331, MATH 3545, POLS 2400

Courses that list CS 1800 in their prerequisites.

Links

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