Course Description

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 computability. Counting: arithmetic and geometric progressions, permutations and combinations, modular arithmetic. Probability.


Prerequisite: CMTH 110
Antirequisite: MTH 210

Relevant Programs


Thank you for your interest in this course. Unfortunately, it is not scheduled for the Spring 2020 term.

Please browse our courses available this term.