MATH 2413 - Discrete Mathematics

3.0 Credit Hours

Discrete Mathematics covers mathematical topics pertinent to computer science, such as logic and Boolean algebra, set theory, proof techniques, relations, functions, graphs, trees, counting techniques, and discrete probability. Proof techniques include induction. Counting techniques include permutations, combinations, recurrences, and sequences, and algorithms to generate them.

Prerequisite(s): Computer Science I/II (Minimum grade: D).

Note: Student may not enroll in MCIS 2413 after completing this course

View Schedule of Classes

Go Beyond!

MATH 2413 - Discrete Mathematics