Discrete Mathematics for Engineers A survey of the fundamental mathematical tools used in computer engineering: sets, relations, and functions; propositional and predicate logic; proof writing strategies, such as direct, contradiction and induction; summations and recurrences; counting and discrete probability; undirected and directed graphs with applications in computer engineering. Credit Hours: 3 Prerequisites: MATH 1113 Duplicate Credit: Not open to students with credit in CSCI (MATH) 2610 Semester Offered: Spring Level: Undergraduate