CMSC 203 - Discrete Structures (3)

This course introduces the fundamental tools, topics and concepts of discrete mathematics needed to study computer science. This course emphasizes counting methods, proof techniques and problem solving strategies. Topics include Boolean algebra; set theory; symbolic logic; predicate calculus; number theory; the methods of direct, indirect and inductive proofs; objective functions; equivalence relations; graphs; set partitions; combinatorics; modular arithmetic; summations; and recurrences.

Grading: Graded/Satisfactory Unsatisfactory/Audit
Course ID: 52883
Consent: No Special Consent Required
Components: Lecture
Attributes: Mathematics (GEP), Mathematics (GFR)
Also Listed As: CMSC 203H.
Prerequisite: MATH 140 or MATH 151 with a grade of ‘C’ or better.