MATH 210 Discrete Mathematics
Covers foundations of mathematics, combinatorial problem-solving, and graph theory. Includes the following topics: propositional logic and Boolean algebra, mathematical induction including applications to number theory, one-to-one, onto and invertible functions, cardinality, big-O, applications to complexity theory and cryptography, equivalence relations, introduction to combinatorics, basic graph theory, and numerous applications. Sustained examination of the interaction of foundational questions in mathematics and computer science.
Prerequisite
Prerequisite: Required Pre-calculus in h.s. or MATH 106 or consent of instructor,
MATH 101 or recommendation by the Math Placement Exam
Course Type
KSA :: (IL) Integrative Learning