MATH 415 - Discrete Mathematics

Credit Hours: 4
Prerequisites: “C” or better in MATH 201
This course develops competency in working with discrete structures that are backbones of computer science. In particular, this class teaches set theory, logic and proofs, relations and functions, sequences and series, algorithms and theory of computation, number theory, induction and recursion, counting and discrete probability, and graph theory (including trees).