| |
May 24, 2021
|
|
|
|
|
MATH 2413 - Discrete Mathematics
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.
Credit Hours
3.0
Note
Student may not enroll in MCIS 2413 after completing this course
Prerequisite
Computer Science I/II
Add to Portfolio (opens a new window)
|
|
Print this Page