CSI 2101 : Discrete Structures

University of Ottawa, Winter 2025

Recent Announcements

Teaching Staff

name email office office hour
Andrej Bogdanov
instructor
abogdano@uottawa.ca SITE 5068 Fr 3–5
Yanbo Chen
TA
ychen918@uottawa.ca SITE 4035 Mo 130–330
Bahar Emami Afshar
TA
bemam006@uottawa.ca SITE 4009 We 330–530
Tianhao Tao
TA
ttao061@uottawa.ca SITE 5002 Th 10–12
Yuzhe Wang
Head TA
ywan1035@uottawa.ca SITE 4003 Th 3–5
Chenbing Xue
corrector
cxue101@uottawa.ca

Course Description

Discrete math is the study of objects that can be built from zeroes and ones. These are the objects that computers can manipulate effectively. They include numbers and graphs but also logical statements and computer programs. We will introduce methods for reasoning about discrete structures, including mathematical proofs, invariants, numbers, summations, recurrences, functions, and graphs.

Schedule

week topic
1 Jan 7
Jan 9
Jan 8
Jan 9
Logic §1.1, §3 |
2 Jan 14
Jan 17
Jan 15
Jan 17
Proofs §1 |
3 Jan 21
Jan 24
Jan 22
Jan 24
Induction §5 |
4 Jan 28
Jan 31
Jan 29
Jan 31
Numbers §8.1-6 |
5 Feb 4
Feb 7
Feb 5
Feb 7
Modular arithmetic §8.7-11 |
6 Feb 11
Feb 14
Feb 12
Feb 14
Sums and Asymptotics §13 |
Feb 18
Feb 21
Feb 19
Feb 21
Reading Week
Feb 25
Feb 27
Feb 26
Feb 27
Review
Midterm Exam

solutions
7 Mar 4
Mar 7
Mar 5
Mar 7
Recurrences §21 |
8 Mar 11
Mar 14
Mar 12
Mar 14
Counting §14 |
9 Mar 18
Mar 21
Mar 19
Mar 21
Graphs §11.1-3, 5-6 |
10 Mar 25
Mar 28
Mar 26
Mar 28
Connectivity and Directed graphs §11.9-10, §9.5, §10.9 |
11 Apr 1 Apr 2 Ramsey numbers (optional)
Apr 4
Apr 16
Apr 4
Apr 16
Review
Final Exam
Review
Final Exam

solutions

Tutorials, Homeworks, and Quizzes

Homeworks won't be graded. They will be issued on Friday and discussed in tutorial on the following Thursday. Try your hand at the homework beforehand and come to tutorial prepared to discuss it.

A short quiz with a single question related to the homework will be given out in the first 15 minutes of the subsequent tutorial.

Course information