(CS 205) Foundations of Discrete Mathematics
Introduction to essential concepts in discrete mathematics with a focus on basic logic, proof techniques, sets, discrete probability, relations, and combinatorics relevant to computer science.
| Credit hours | 3.0 lecture |
|---|---|
| Prerequisite | CS 101 w/ C or better |
| Offered | Fall, winter |
| Programs | Computer Science (BS), Computer Science Minor |
Course Learning Outcomes
- Analyze logical arguments, decompose them into basic components, and express them using symbolic notation.
- Construct proofs using propositional logic and various proof techniques.
- Recognize, design, and implement recursive algorithms.
- Apply set theory, combinations, and permutations to address combinatorial problems.
- Utilize probability rules to solve statistical problems in computer science contexts.
- Explore different types of relations and their connections to sets and databases.
- Understand graph theory terminology and apply graph theory concepts to solve computer-related problems.