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
Lec A
Mon, Wed 9:00-10:15
Lec B
Tue 18:00-20:45
Tutorial, pick one
Tut T01
Thu 15:00-15:50
Tut T02
Fri 9:00-9:50
Tut T03
Tue 21:00-21:50
Syllabus
Have the syllabus for CPSC 1820? Share it and everyone gets the grading, textbooks and rules.