Answers final exam:

1C, 2A, 3B, 4D, 5A, 6C, 7D, 8B, 9C, 10A, 11B, 12C, 13D, 14A, 15B, 16B, 17D, 18C, 19A, 20C, 21B, 22D, 23B, 24C, 25A

Discrete Structures II (COMP 2804)
Winter 2017

Instructor: Michiel Smid
Office: Herzberg Building 5125C
E-mail: michiel(
Lectures: Monday/Wednesday, 10:05am-11:25am, University Centre 231
Office hours: Tuesday, 10-noon
Teaching assistants:
Course objectives: A second course that is designed to give students a basic understanding of Discrete Mathematics and its role in Computer Science. Computers handle discrete data rather than continuous data. The course presents an overview of some of the major theoretical concepts needed to analyze this type of data.
Topics covered include: Counting, recursion, discrete probability, random variables, randomized algorithms. Material is illustrated through examples from computing.
Important dates:
Grading scheme:
Final exam:
What was done in class:
Tentative schedule: