| name | office hour | |
|---|---|---|
| Andrej Bogdanov instructor |
abogdano@uottawa.ca | Mo 1-3 in SITE 5068 |
| Zachary Levesque-Bartlett TA |
zleve009@uottawa.ca | Fr 10-12 on teams |
| Vishal Meenakshi Sundaram TA |
vmeen102@uottawa.ca | Tu 930-1130 on teams |
| Tianhao Tao Head TA |
ttao061@uottawa.ca | Th 10-12 in SITE 5002 |
| Lorenzo Taschin corrector |
ltasc072@uottawa.ca |
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. You will learn methods for reasoning about discrete structures, including mathematical proofs, invariants, numbers, summations, recurrences, functions, and graphs.
| week | topic | ||
|---|---|---|---|
| 1 |
Jan 12 Jan 14 Jan 13 Jan 15 |
Logic | §1.1, §3 | ✎ |
| 2 |
Jan 19 Jan 21 Jan 22 Jan 23 |
Proofs | §1 | ✎ |
| 3 |
Jan 26 Jan 28 Jan 29 Jan 30 |
Induction | §5 | ✎ |
| 4 |
Feb 2 Feb 4 Feb 5 Feb 6 |
Numbers | §8.1–6 | ✎ |
| 5 |
Feb 9 Feb 11 Feb 12 Feb 13 |
Modular arithmetic | §8.7–11 | ✎ |
|
Feb 18 Feb 21 Feb 19 Feb 21 |
Reading Week | ||
| 6 |
Feb 23 Feb 25 Feb 26 Mar 6 |
Sums and Asymptotics | §13 | ✎ |
|
Mar 2 Mar 3 Feb 27 Mar 3 |
Review Midterm Exam |
||
| 7 |
Mar 9 Mar 11 Mar 12 Mar 13 |
Recurrences | §21 | ✎ |
| 8 |
Mar 16 Mar 18 Mar 19 Mar 20 |
Counting | §14 | ✎ |
| 9 |
Mar 23 Mar 25 Mar 26 Mar 27 |
Graphs | §11.1–3, 5–6 | ✎ |
| 10 |
Mar 30 Apr 1 Apr 2 Apr 9 |
Connectivity and Directed graphs | §11.9–10, §9.5, §10.9 | ✎ |
| 11 | Apr 8 Apr 10 | Ramsey numbers (optional) | ✎ |
|
Apr 13 TBA Apr 14 TBA |
Review Final Exam |
Homeworks won't be graded. They will be issued on Friday and discussed in tutorial on the following Tuesday. 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.