MTH 231 - Discrete Mathematics

Credits: 3

This course introduces foundational concepts from this field that underpin higher mathematics, algorithm analysis, discrete probability, and theoretical computer science: basic set operations, concepts from mathematical and propositional logic, fundamental techniques for formal arguments including proofs, existential vs universal quantifiers, mathematical induction, Cartesian products of sets, equivalence relations, order relations, combinatorics, r-permutations and r-combinations of sets and multisets and the pigeonhole principle, graph theory and basic properties of graphs including paths, cycles, graph isomorshisms, graph colorings, trees, and their algorithmic applications.

Pre-Requisites: MTH 111 with grade of 2.0 or better
Repeatable: May not be repeated for credit
Lecture: 3