Discrete Mathematics for Computer Science A survey of the fundamental mathematical tools used in Computer Science: 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; and counting and discrete probability with applications in computer science. Credit Hours: 4 Prerequisites: MATH 1113 or MATH 1113E Level: Undergraduate
