Discrete Mathematics.

Catalog description

This course provides a rigorous study of the concepts and applications of topics designed to prepare math, computer science, and engineering majors for a background in abstraction, notation, and critical thinking for the mathematics most directly related to computer science. Topics include: logic, relations, functions, basic set theory, countability and counting arguments, proof techniques, mathematical induction, combinatorics, discrete probability, recursion, sequence and recurrence, elementary number theory, graph theory, and mathematical proof techniques. Appropriate computer software and hand held technologies will be utilized. Prerequisite: MATH 2413 with a C or better or instructor permission.