CSCA67: Discrete Mathematics

Introduction to discrete mathematics: Elementary combinatorics; discrete probability including conditional probability and independence; introduction to graph theory possibly including trees, planar graphs, colouring. The course emphasizes topics of relevance to computer science and discrete mathematics, and exercises problem-solving skills and proof techniques such as well ordering, induction, contradiction, and counterexample.

I didn’t preserve any further resources 😟

Adapted from the Dinky theme on Github Pages