Course DescriptionIntroduction 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.
RequisitesPrerequisite: CMTH 110
Antirequisite: MTH 210
- Computer Programming Applications : Electives (select 2)