CS 202 - Discrete Structures I

Credits: 5
Variable Credit Course: No

Lecture Hours: 55
Lab Hours: 0
Worksite/Clinical Hours: 0
Other Hours (LIA/Internships): 0

Course Description: Set theory, relations, functions, formal logic, constructing proofs, computing with base-n numbers, combinatorics, and discrete probability with applications.

Prerequisite: CS 171 with grade C or higher.
Meets FQE Requirement: No
Integrative Experience Requirement: No

Student Learning Outcomes

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

Course Contents

Logical notations and fundamental mathematical concepts such as sets, relations, functions, and integers.
Induction hypotheses and simple proofs, including induction and other techniques.
Elementary properties of modular arithmetic and applications in computer science such as cryptography, hashing algorithms.
Possible outcomes of combinatorial processes such as permutations and combinations.
Probabilities and discrete distributions for simple combinatorial processes.

Instructional Units: 5