CISC 203: Discrete Mathematics for Computing II (Winter 2019)

This webpage contains archived material from a past offering of this course.
Contents may differ from the current or most recent offering of the course.

Course Description

Proof methods. Combinatorics: permutations and combinations, discrete probability, recurrence relations. Graphs and trees. Boolean and abstract algebra.

See the course outline for more information.

Course Details

Lecture Time/Place

Tuesday, 12:30pm–1:30pm; Thursday, 11:30am–12:30pm; Friday, 1:30pm–2:30pm.

All lectures are held in Goodwin Hall, room 254.


E. Scheinerman, Mathematics: A Discrete Introduction. Cengage Learning, 3rd edition, 2012.

The textbook is available for sale at the campus bookstore. Course notes will also be provided for each lecture.

Marking Scheme

You must pass the final exam to pass the course.



Week Notes Readings
1 Introduction, Review, Proof Techniques Scheinerman, 1.2–1.6, 4.20–4.22 (Problem set)
2 Combinatorics: basic techniques, permutations Scheinerman, 2.8, 3.19, 5.25, 5.27 (Problem set)
3 Combinatorics (cont’d): combinations, binomial theorem Scheinerman, 3.17–3.18
4 Discrete Probability: definitions, properties, conditionals, RVs Scheinerman, 6.30–6.33 (Problem set)
5 Discrete Probability (cont’d): RVs, expectation; Recurrences Scheinerman, 6.33–6.34, 4.23 (Problem set)
6 Recurrences (cont’d), Algorithm Analysis (bonus topic) Scheinerman, 4.23 (optional: 5.29)
Reading week
7 Review session and midterm; Graphs: definitions Scheinerman, 9.47–9.48 (Problem set)
8 Graphs (cont’d): representations, paths/circuits, connectivity Scheinerman, 9.49, 9.51
9 Graphs (cont’d): isomorphisms, planarity, colouring Scheinerman, 9.52–9.53
10 Trees: definitions, properties, representations Scheinerman, 9.50 (Problem set)
11 Trees (cont’d): traversals, spanning trees Scheinerman, 9.50
12 Boolean and Abstract Algebra Scheinerman, 1.7, 8.40 (Problem set)


Assignments are due at the beginning of class on the due date. Late assignments will be accepted up to the beginning of the first class following the due date. Late assignments are subject to a penalty of 10% deducted from the earned mark.



Date: February 28, 2019
Time: 11:30am–12:20pm
Place: Goodwin Hall, room 247 (last names A–M) and Goodwin Hall, room 254 (last names N–Z)
Content: All material from lectures up to and including Week 6

Final Exam

Date: April 26, 2019
Time: 7:00pm–9:00pm
Place: Mitchell Hall, gym 5
Content: All material from all lectures



Taylor J. Smith
Email: tsmith [at] cs [dot] queensu [dot] ca
Office: Goodwin Hall, room 235
Office hours: Tuesday, 1:30pm–2:30pm; Thursday, 12:30pm–1:30pm

Teaching Assistants

Xavier McMaster-Hubner
Email: 17xjem [at] queensu [dot] ca
Office: Goodwin Hall, room 241
Office hours: Monday, 10:30am–11:30am

Leonard Zhao
Email: 16lz1 [at] queensu [dot] ca
Office: Goodwin Hall, room 241
Office hours: Wednesday, 10:30am–11:30am