Introduction to discrete mathematics: Elementary combinatorics; discrete probability including conditional probability and independence; graph theory including trees, planar graphs, searches and traversals, colouring. The course emphasizes topics of relevance to computer science, and exercises problem-solving skills and proof techniques such as well ordering, induction, contradiction, and counterexample.
Same as MATA67H3
Grade 12 Calculus and Vectors and one other Grade 12 mathematics course
MATA67H3, (CSCA65H3), CSC165H, CSC240H, MAT102H