CS 202 - Discrete Structures I

5.0 Credits
An introductory course covering the study of objects that have discrete as opposed to continuous values including the foundations of logic, algorithm complexity, mathematical induction andreasoning, recursion, relations, and combinatorics.
Prerequisite Completion of CS& 141 with a grade of 2.5 or higher or instructor permission.
Course-level Learning Objectives (CLOs)
Upon successful completion of this course, students will be able to:

Use logical notation to define and reason about fundamental mathematical concepts such as sets, relations, functions, and integers.
Formulate induction hypotheses and write simple induction proofs.
Use the elementary properties of modular arithmetic and explain their applications in computer science such as cryptography and hashing algorithms.
Calculate the possible outcomes of combinatorial processes such as permutations and combinations.
Calculate probabilities and discrete distributions for simple combinatorial processes.

Course Typically Offered
Fall, Winter