Readings are from the textbook.
This schedule is only tentative. We may need to make adjustments as we move through the term.
| Week | Topics | Readings | Lecture Notes | Study Problems | Notes and Extras |
|---|---|---|---|---|---|
| Week 1 Jan 19-23 |
Logic | 1.1-1.7, 1.10 chapter 2 |
Week 1 | math prerequisites logic |
Thurs is lecture (not tutorial) |
|
Week 2 |
Proofs | Chapter 3 | Week 2 | proofs | first tutorial Th |
|
Week 3 |
Number Theory | Chapter 4.1-4.11 | Week 3 | number theory | first examlet Tu-Th |
| Week 4 Feb 9-13 |
Modular Arithmetic Sets |
4.12-4.14 chapter 5 |
Week 4 | modular arithmetic set theory |
|
| Week 5 Feb 16-20 |
Functions | chapters 7 and 8 | Week 5 | functions | |
| Week 6 Feb 23-27 |
Collections of sets Graphs |
chapter 9 chapter 10 (except 10.3) |
collections of sets (#1 and #4 only)
graphs |
||
| Week 7 March 2-6 |
2-way bounding Contradiction |
chapter 11, 18 | two-way bounding
contradiction |
||
| Week 8 March 9-13 |
Induction | 1.8-1.9; chapter 12 | easier induction | ||
| Spring break March 16-20 |
Break! | Break! | |||
| Week 9 March 23-27 |
Recursive Definition | chapter 13 | unrolling induction |
||
| Week 10 March 30-April 3 |
Trees Grammars |
chapter 14 | tree induction recursion trees |
||
| Week 11 April 6-10 |
Big-O Algorithms |
chapter 15; 16.1-16.8 | inequality induction | ||
| Week 12 April 13-17 |
Algorithms NP |
16.9 | algorithms | ||
| Week 13 April 20-24 |
State Diagrams |
chapters 19 | state diagrams | ||
| Week 14 April 27-May 1 |
Countability | chapter 20 | countability | Examlet 12 is Wed-Fri | |
| Week 15 May 4-8 |
Partitions? More on inequalities? |
10.2-10.3 | collections of sets (#2 only) | Our final starts Thursday May 7th. | |
| Finals Week May 11-15 |
Our final ends on Wednesday the 13th. | ||||