CS 302 - Discrete Structures II

5.0 Credits
This course builds on CS 202 tointroducestudents to more ideas and techniques from discrete mathematics. These techniquesform the basis of data structures and algorithms used in Computer Science. Students will learn the fundamentals of graph theory, set theory, relations, enumeration, and recursive structures.
Prerequisite Completion of CS 202 and CS 301 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:

Construct mathematical arguments and communicate them formally and informally.
Write proofs of multiple types such as, direct proof, proof by contradiction, proof by cases, and mathematical induction.
Evaluate elementary mathematical arguments and identify incorrect reasoning (not just incorrect conclusions).
Prove elementary properties of modular arithmetic and explain their applications in Computer Science such as in cryptography and hashing algorithms.
Apply graph theory models of data structures and state machines to solve problems of connectivity and constraint satisfaction such as scheduling.
Apply the method of invariants and well-founded ordering to prove correctness and termination of processes and state machines.
Calculate numbers of possible outcomes of elementary combinatorial processes such as permutations and combinations.

Course Typically Offered
Spring