|Select the Course Number to get further detail on the course. Select the desired Schedule Type to find available classes for the course.|
|MATH 325 - Discrete Mathematics|
An introduction to the mathematics of enumeration to include counting, inclusion-exclusion, generating functions, and recursion. Basic graph theory (paths, circuits, planarity, trees, colorings) and Boolean algebra. Numerous applications to a wide variety of disciplines such as computer science, engineering, operations research, biology, chemistry, and political science. Prerequisite: “C” or better in MATH 142. Three semester hours.
3.000 Credit hours
3.000 Lecture hours
Levels: Second Degree, Undergraduate
Schedule Types: Lecture
Math & Computing Department