Discrete Mathematics for Computer Science This course presents 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; elementary asymptotics and timing analysis; counting and discrete probability; undirected and directed graphs with applications in computer science. Credit Hours: 4 Prerequisites: MATH 1113 Semester Offered: Fall Spring Level: Undergraduate Course Information File: CIS_CSCI_2610_0.pdf (145.33 KB)
