MATH2100 — Discrete Mathematics
MATH 2100 - Discrete Mathematics MATH 2100 - Discrete Mathematics Catalog Description Intended for math and/or computer science majors/minors. Topics include: logic, sets, functions, partitions and equivalence relations, binary operations, composition of functions, mathematical induction, combinatorics, matrix representations of graphs, isomorphisms of graphs, trees and spanning trees, recurrence relations, and generating functions. Applications include: Boolean algebra, algorithms and their efficiency, pigeon hole principle, and the halting problem. Prerequisite(s) (must have a grade of C or better): MATH 1400 Cross-Listed Course(s): CSCI 2100
Prerequisites: MATH1400, CSCI2100