CMSC 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: Course offered fall, spring, and may be offered during additional sessions

Same As: MATH 243
Prerequisite(s): MATH 165 with a grade of “C” or better