CPE 2400 - Discrete Mathematics

Prerequisite(s): MA 1060
Provides tools for formal reasoning with a particular focus on applications in computer engineering. Topics include counting rules, propositional and first-order logic, set theory, functions (with an emphasis on recursive functions), partial order and equivalence relations, Boolean algebra, switching circuits, graphs and trees 3 Credit Hours. Credit(s): 3 (0 plus 3)