MAT 216 Discrete Mathematics

Prerequisite: Waiver or completion of MAT 012

Discrete mathematics is the study of mathematical structures which may be described by the integers and which typically consider finite, distinctly separated values. Selected topics for this course include: counting techniques, Boolean logic, set theory, mathematical induction and recursion with an emphasis on combinatorial graphs (aka networks). Applications and mathematical ideas of particular use to computer science will be
emphasized. Non-credit for students who have completed MAT 415.


1 Course Credit