Discrete Mathematics

Catalog description

Three lecture. Course emphasizes discrete mathematics connections to computer science by exposing students to foundational concepts of set theory, logic, counting, induction, proof techniques, graph theory, and algorithms. Students will be able to: establish the validity of logical propositions; compare the cardinality of given sets; determine the correctness of a proof; classify a proof; solve a recurrence relation; identify the properties of a relation; create proofs using relations, order relations, and equivalence relations; calculate permutations and combinations of sets; calculate the empirical probability of an event; solve problems involving modular arithmetic; identify the properties of a graph; determine paths, cycles, and connectivity given a graph; represent a graph with its incidence matrix; use Big-O notation to study the growth of a given function. Prerequisite(s): MAT 220.