You are now in the main content area

CPS 420

Discrete Structures

Introduction to discrete structures and probability as they apply to design and analysis. Review of proof techniques: induction and recursion. Graphs and trees, and their applications in computing. Finite automata and regular expressions. Counting: arithmetic and geometric progressions, permutations and combinations, modular arithmetic.
Weekly Contact: Lecture: 3 hrs.
GPA Weight: 1.00
Course Count: 1.00
Billing Units: 1


MTH 110, CPS 109




MTH 210

Custom Requisites


Mentioned in the Following Calendar Pages

*List may not include courses that are on a common table shared between programs.