This course covers discrete mathematics for computer science, including elementary propositional and predicate logic, sets, relations, functions, counting, elementary graph theory, proof techniques including proof by induction, proof by contradiction, and proof by construction.

**Class Lectures**: 11am-12:15pm Tuesdays and Thursdays in EB 145