CPS 220 - Discrete Computational Structures

3 Credit Hour(s) Laboratory: 0 Recitation: 3 Alternative Mode: 0

The fundamental computational structures underlying computer science. Sets, graph theory, recurrence relations, Boolean logic, combinatorics, finite automata, and the theory of computation. (Fall, odd-even years)

Prerequisite(s): MTH 119; or Placement into or completion of MTH 121 or higher.
GE 2025 +: Math-Based Course