COMPSCI 1DM3 — Discrete Mathematics for Computer Science
Sets, functions, relations, trees and graphs; counting principles, modular arithmetic, discrete probabilities; induction and recursion, recurrence relations.
Terms offered: Winter, Spring, Summer
Antirequisites: COMPSCI 2DM3, SFWRENG 2DM3, SFWRENG 2E03, SFWRENG 2F03