COMPSCI 1DM3 - Discrete Mathematics for Computer Science

3 unit(s)

Sets, functions, relations, trees and graphs; counting principles, modular arithmetic, discrete probabilities; induction and recursion, recurrence relations.
Three lectures, one tutorial (two hours), second term; may be offered also in the first term
Prerequisite(s): One of the following:
*Registration in Computer Science 1 and one of MATH 1B03, 1ZC3
*One of MATH 1B03, 1ZC3 with a result of at least B
Antirequisite(s): COMPSCI 2DM3, SFWRENG 2DM3, 2E03, 2F03