COMPSCI 2DM3 - Discrete Mathematics with Applications I

3 unit(s)

Functions, relations and sets; the language of predicate logic, propositional logic; proof techniques, counting principles; induction and recursion, discrete probabilities, graphs, and their application to computing.
Three lectures, one tutorial (one hour); first term
Prerequisite(s): MATH 1ZC3 or MATH 1B03 or registration in the Honours Computer Science as a Second Degree (B.A.Sc.)
Antirequisite(s): COMPSCI 1FC3, SFWRENG 2DM3, 2E03, 2F03