Loading...

Course Description

Introduction to discrete structures 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.

Requisites

Prerequisite: CCPS 305, CMTH 110
Antirequisite: MTH 210
Loading...

Thank you for your interest in this course. Unfortunately, this course currently isn't available.

Please browse our courses for more options or check back later for updated scheduling.