Discrete Mathematics

Catalog description

An introduction to the mathematical structures and reasoning methods that underlie computer science and combinatorics. Topics include propositional and predicate logic, sets, relations, functions, mathematical induction, recursion, counting methods, graphs, and trees, with some elements of abstract algebra. The course emphasizes rigorous reasoning and proof techniques in discrete settings. Prerequisites: C- or better in MATH 225 or consent of instructor. Every semester.