MATH 137 - Introduction to Discrete Mathematics

This is an introduction to analysis of finite collections and mathematical foundations of sequential machines, computer system design, data structures and algorithms. It includes 6 of the following: sets, counting, recursion, graph theory, trees, Boolean algebra, automata, and formal grammars and languages. Prerequisite(s): Appropriate placement score or minimum grade “C” in MATH 131 , or MATH 138  or MATH 142 , or equivalent
Is course repeatable for credit? No
Variable Hour Exist No
Mode of Delivery Traditional, Hybrid, Online, HyFlex, Synchronous
Is this a Human Relations/Diversity Course? No
Is this an International Course? No
Semesters Offered Fall, Spring, Summer