CMSC 203 — Discrete Structures
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 may 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.
Be sure to read through the syllabus for more information.
| Section | Days | Time | Location |
|---|---|---|---|
| 06 | TuTh | 1:00 – 2:15 | Sherman 003 |