| name | office | office hour | |
|---|---|---|---|
| Andrej Bogdanov instructor |
abogdano@uottawa.ca | SITE 5068 | Fr 10–12 |
| Jahan Baloch TA |
jjaha037@uottawa.ca | SITE 3032 | Th 1-2 |
| James Dickens TA |
jdick088@uottawa.ca | SITE 3035 | We 3–4 |
| David Owusu TA |
dowus053@uottawa.ca | SITE 4009 | Tu 130–230 |
| Sam Yuen corrector |
zyuen077@uottawa.ca | ||
| David Worley Head TA |
dworl020@uottawa.ca | SITE 5000D | Th 2–3 |
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 various kinds of numbers and graphs but also logical statements and computer programs. We will introduce methods for reasoning about discrete structures, including mathematical proofs, invariants and recurrences and touch upon a few applications such as public-key encryption.
| week | topic | materials | |
|---|---|---|---|
| 1 | Jan 10 Jan 13 Jan 11 Jan 13 |
Logic | §1.1, §3 pdf pptx |
| 2 | Jan 17 Jan 20 Jan 18 Jan 20 |
Proofs | §1 pdf pptx |
| 3 | Jan 24 Jan 27 Jan 25 Jan 27 |
Induction | §5 pdf pptx |
| 4 | Jan 31 Feb 3 Feb 1 Feb 3 |
Numbers | §8.1-6 pdf pptx |
| 5 | Feb 7 Feb 10 Feb 8 Feb 10 |
Modular arithmetic | §8.7-11 pdf pptx |
| Feb 14 Feb 16 Feb 15 Feb 16 |
Review Midterm Exam 1 |
solutions |
|
| Feb 21 Feb 24 Feb 22 Feb 24 |
Reading Week | ||
| 6 | Feb 28 Mar 3 Mar 1 Mar 3 |
Sums and Asymptotics | §13 pdf pptx |
| 7 | Mar 7 Mar 10 Mar 8 Mar 10 |
Recurrences | §21 pdf pptx |
| 8 | Mar 14 Mar 17 Mar 15 Mar 17 |
Graphs and Matchings | §11.1-3,5-6 pdf pptx |
| Mar 21 Mar 23 Mar 22 Mar 23 |
Review Midterm Exam 2 |
solutions |
|
| 9 | Mar 28 Mar 31 Mar 29 Mar 31 |
Connectivity and Directed graphs | §11.9-10, §9.5, §10.9 pdf pptx |
| 10 | Apr 4 Apr 7 Apr 5 Apr 7 |
Circuits and Backpropagation Easter Holiday |
pdf pptx |
| Apr 11Apr 11 Apr 14 |
Review (Fr schedule) Final Exam |
solutions |
Homeworks won't be graded. They will be issued on Friday and discussed in tutorial on the following ThursdayFriday. 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 10 minutes of the subsequent tutorial.