MTH 231 — Elements Of Discrete Math

An introductory course in discrete mathematics covering elementary logic and set theory, functions, relations, direct and indirect proof techniques, mathematical induction, recursion, elementary combinatorics, basic graph theory, and minimal spanning trees. Applications of these topics in computer science are stressed.

Prerequisites: MTH 111Z