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

Relevant Programs

Loading...

Thank you for your interest in this course. There are no sections currently available for enrolment.

Course offerings for the upcoming academic year will be published on June 1, 2026. Please check back then, or complete the form below to be notified when new sections become available.