Readings are from the textbook.

This schedule is only tentative. We may need to make adjustments as we move through the term.

Week	New topic	Readings	Lecture notes	Lecture videos	Problems from lecture	Additional study problems	(optional) Videos with worked examples
Week 1 Jan 20-24	Logic	1.1-1.4, 1.7; chapter 2	Intro Logic 1 Logic 2 Logic 3	Intro Logic 1 Logic 2 Logic 3	Week 1 problems (solutions)	math prerequisites logic
Week 2 Jan 27-31	Proofs + Number Theory	Chap. 3, 4.1-4.11	Proofs 1 Proofs 2 Numbers 1 Numbers 2	Proofs 1 Proofs 2 Numbers 1 Numbers 2	Week 2 problems (solutions)	proofs number theory
Week 3 Feb 3-7	Modular Arithmetic + Sets	4.12-4.14, chapter 5	Numbers 3 Sets 1 Sets 2	Numbers 3 Sets 1 Sets 2	Week 3 problems (solutions)	modular arithmetic set theory	Sp 20 Examlet 3
Week 4 Feb 10-14	Collections of Sets	7.1, chapter 18	COS 1 COS 2 COS 3	COS 1 COS 2 COS 3	Week 4 problems (solutions)	collections of sets
Week 5 Feb 17-21	Functions	chapters 7 (other than 7.1) and 8	Functions 1 Functions 2 Functions 3 Functions 4	Functions 1 Functions 2 Functions 3 Functions 4	Week 5 problems (solutions)	functions
Week 6 Feb 24-28	Graphs + 2-way bounding	chapters 9 and 10	Graphs 1 Graphs 2 Bounding	Graphs 1 Graphs 2	Week 6 problems (solutions)	graphs two-way bounding	A confusion about two-way bounding for graph coloring
Week 7 March 3-7	Induction	1.5-1.6; chapter 11	Induction 1 Induction 2 Induction 3 Induction 4	Induction 1 Induction 2 Induction 3 Induction 4	Week 7 problems (solutions)	easier induction	Induction example (notes) Fall`20's intro (notes)
Week 8 March 10-14	Recursive Definition	chapter 12	Rec. Defn 1 Rec. Defn 2 Rec. Defn 3	Rec. Defn 1 Rec. Defn 2 Rec. Defn 3	Week 8 problems (solutions)	unrolling induction	Induction to justify a closed form Unrolling & Induction
Spring break March 17-21	Break!		Break!		Break!
Week 9 March 24-28	Trees + Grammars	chapter 13	Trees 1 Trees 2 Trees 3	Trees 1 Trees 2 Trees 3	Week 9 problems (solutions)	tree induction	Recursion Trees
Week 10 March 31-April 4	Big-O + Algorithms	chapter 14; 15.1-15.8	Algorithms 1 Algorithms 2 Algorithms 3	Algorithms 1 Algorithms 2 Algorithms 3	Week 10 problems (solutions)	recursion trees inequality induction
Week 11 April 7-11	Algorithms	15.9, chapter 16	Algorithms 4 Algorithms 5	Algorithms 4 Algorithms 5	Week 11 problems (solutions)	algorithms
Week 12 April 14-18	Contradiction	chapter 17	contradiction 1 contradiction 2	contradiction 1 contradiction 2	Week 12 problems (solutions) Proof techniques from Dana Angluin	contradiction
Week 13 April 21-25	State Diagrams	chapter 19	state diagrams 1 state diagrams 2 state diagrams 3	State Diagrams 1 State Diagrams 2 State Diagrams 3	Week 13 problems (solutions)	state diagrams
Week 14 April 28-May 2	Countability	chapter 20	countability 1 countability 2 countability 3 countability 4	Countability 1 Countability 2 Countability 3 Countability 4	Week 14 problems (solutions)	countability
Week 15 May 5-9	No lecture/tutorial		Review session Friday 6-8pm Siebel 2405		Our final starts May 8th.
Finals Week	Our final runs through Wednesday the 14th.