| |
| |
Jul 17, 2025
|
|
|
|
|
|
Academic Programs and Courses
University Information
Academic Requirements and Regulations
Student Life and Campus Services
Financial Information
Faculty Listing
Additional Information
|
|
|
|
|
|
|
CMSC 203H - 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: 102991
Consent: No Special Consent Required
Components: Lecture
Attributes: Mathematics (GEP)
Also Listed As: CMSC 203
Prerequisite: MATH 140 or MATH 151 with a grade of ‘C’ or better.
Add to Portfolio (opens a new window)
|
|
|
|
