CPSC 1820

Discrete Structures

Lec A and Tut T01 selected

Introduction to proofs. Algorithms and complexity. Divisibility and modular arithmetic. Matrix algebra. Counting. Discrete probability. Graphs and trees. Prerequisite(s): One of Mathematics 30-1, Mathematics 30-2, Pure Mathematics 30, Mathematics 0500, Mathematics 0520, or admission to the Post-Diploma B.Sc. in Computer Science

Sections

Lecture, pick one
Tutorial, pick one

Syllabus

Have the syllabus for CPSC 1820? Share it and everyone gets the grading, textbooks and rules.