MCKE 5007

Discrete MathCounting the Possibilities

Systematic study of basic techniques in discrete mathematics and their various applications: permutations and combinations, inclusion or exclusion, pigeonhole principle, graph theory, and recursive pattern solving. Applications to topics such as network analysis and voting theory are stressed. Concepts are linked to other scientific, mathematical, pedagogical domains. This course is not applicable toward any degree in the College of Liberal Arts and Sciences. Note: this course assumes that students have completed MATH 5000 or equivalent

Units: 4.0

Hours: 4 to 4