MATH 3322 - Discrete Mathematics I

3 Class Hours 0 Laboratory Hours 3 Credit Hours
Prerequisite: A grade of “C” or better in MATH 1190.
This course will provide an elementary introduction to topics in Combinatorics and Graph Theory. Counting techniques will include the multiplication rule, addition rule, binomial coefficients, the binomial theorem, inclusion/exclusion and discrete probability. Students will construct proofs using inductive and combinatorial methods. Elementary Graph Theory definitions and examples will be introduced along with the handshaking lemma and graph isomorphisms.