MATH 152 - Elementary Discrete Mathematics II

3 Credit(s)

A continuation of MATH 151. Topics include functions, recursion, graph theory, algebraic structures, and combinatorics. Combinatorial problems are solved using various counting techniques including permutations, combinations, inclusion-exclusion, and the binomial theorem. Various graph algorithms are studied and their complexities evaluated. Proof techniques are stressed.
Prerequisite(s): MATH 151.