MATH243 — Discrete Mathematics
MATH 243 - Discrete Mathematics MATH 243 - Discrete Mathematics 4 Credit(s). Introduces the theoretical tools for describing algorithmic operations; covers set theory, the number system, the nature of proofs, recursion, formal logic, proof by induction, combinatorics, recurrence relations, graph theory, search problems, finite state automata, grammars, and languages. Note: Formerly as CMSC 243, earn credit for one only. Course every fall, spring and may be during additional sessions. Prerequisite(s): MATH 165 with a grade of “C” or better General Education: Mathematics (M) Common Course Outline: MATH 243 CCO
Prerequisites: MATH165