Discrete Mathematics

Catalog description

Mathematical logic and proofs are introduced and used to discuss sets, functions, mathematical induction, and countability. Counting methods are covered which include permutations, combinations, and applications to probability. Introductory graph theory topics may include isomorphisms, Euler and Hamiltonian circuits, directed graphs, spanning trees. Computer programming is used to carry out various algorithms throughout the course. Prerequisite: acceptable placement score or grade of C or higher in MATH 112.