EECS 203
Discrete Math
Introduction to the mathematical foundations of computer science. Topics covered include: prepositional and predicate logic, set theory, functions and relations, growth of functions and asymptotic notation, introduction to algorithms, elementary combinatorics, and graph theory, and discrete probability theory.
Topics
- prepositional and predicate logic
- set theory
- functions and relations
- growth of functions and asymptotic notation
- introduction to algorithms
- elementary combinatorics
- and graph theory
- and discrete probability theory
Topics explicitly listed in official catalogue description
Prerequisites & course information
MATH 115 or 116 or 119 or 120 or 121 or 156 or 175 or 176 or 185 or 186 or 214 or 215 or 216 or 217 or 255 or 256 or 285 or 286 or 295 or 296 or 417 or 419 or ROB 201; (C or better, no OP/F). (Prerequisites enforced at registration.) (MSA). (BS). (QR/1). May not be repeated for credit.
Sources
- Course catalogue ↗2026-2027
- Catalogue entry ↗
Catalogue variants
- Discrete Mathematics · 4 · College of Engineering catalogue