Lecture and Tutorials schedule


Lectures

Each week has a set of lecture videos and their associated notes. These assume that you have already done the posted reading assignment from the textbook. So they do not walk through basic definitions but, rather, concentrate on aspects of the topic that you probably didn't fully understand after doing the readings. (The first-week videos are more comprehensive because we are just getting started.)

If you miss a Tuesday in-person lecture discusison, you can find recordings on Media Space.

Tutorials

Many of our tutorial problems will be taken from this manual of discussion problems. Additional problems will be posted below, as needed. Answers to tutorial problems will be posted in the evenings after tutorial.

You will work with the people sitting near you; feel free to sit near the same people each week or to move around and meet new people.

Additional study problems

We encourage you to do the additional study problems listed below. You should write up a solution to each problem on your own, as if you were taking an exam or turning in a graded homework, before checking your answers against the posted solutions. Writing up the answers is important, since it forces you to work through the details and practice composing a polished proof.

Additional practice problems, sample exams, etc may be found on the web pages for previous offerings of this course. There are differences from term to term and online exams are obviously a bit different from paper ones, but you'll find that the basic techniques and concepts are similar.

The last column includes some demo solutions to some past examlet problems. The content in this column is optional, and aims to help you see sample solutions to problems, as well as how to write a clean and rigorous proof. Videos in this column will be added gradually during the semester. For each demo, like any other practice problem, you are encouraged to solve the problem first before watching the solution.

Week New topic Readings Lecture notes Lecture videos Tuesday Lecture Discussion Additional study problems (optional) Videos with worked examples
Week 1
Aug 26-30
Logic 1.1-1.4, 1.7; chapter 2 Intro
Logic 1
Logic 2
Logic 3
Intro
Logic 1
Logic 2
Logic 3
this problem
(solution)
math prerequisites
logic
 

Week 2
Sep. 2-6

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
Problems with Solutions
proofs
number theory
 

Week 3
Sep 9-Feb 13

Modular Arithmetic
+
Sets
4.12-4.14, chapter 5 Numbers 3
Sets 1
Sets 2
Numbers 3
Sets 1
Sets 2
Problems with Solutions
modular arithmetic
set theory
Sp 20 Examlet 3
Week 4
Sep 16-20
Collections of Sets 7.1, chapter 18 COS 1
COS 2
COS 3
COS 1
COS 2
COS 3
Problems with Solutions collections of sets  
Week 5
Sep 23-27
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
Problems with Solutions functions  
Week 6
Sep 30-Oct 4
Graphs
+
2-way bounding
chapters 9 and 10 Graphs 1
Graphs 2
Bounding
Graphs 1
Graphs 2
Bounding
Problems with Solutions graphs
two-way bounding
A confusion about two-way bounding for graph coloring
Week 7
Oct 7-11
Induction 1.5-1.6; chapter 11

Induction 1
Induction 2
Induction 3
Induction 4

Optional:
Fall`20's intro

Induction 1
Induction 2
Induction 3
Induction 4

Optional:
Fall`20's intro

Problems with Solutions easier induction A worked example (notes)
Week 8
Oct 14-18
Recursive Definition chapter 12 Rec. Defn 1
Rec. Defn 2
Rec. Defn 3

Rec. Defn 1
Rec. Defn 2
Rec. Defn 3

Problems unrolling
induction
Demo: induction to justify a closed form
Demo: Unrolling & Induction
(ignore mentions of a 
"previous demo")
Week 9
Oct 21-25
Trees
+
Grammars
chapter 13 Trees 1
Trees 2
Trees 3
Trees 1
Trees 2
Trees 3
Problems with Solutions tree induction Demo: Recursion Trees
Week 10
Oct 28-Nov 1
Big-O
+
Algorithms
chapter 14; 15.1-15.8 Algorithms 1
Algorithms 2
Algorithms 3
Algorithms 1
Algorithms 2
Algorithms 3
Problems and Solutions recursion trees
inequality induction
 
Week 11
Nov 4-8
Algorithms

15.9

optional:
chapter 16

Algorithms 4

optional:
Algorithms 5

Algorithms 4

optional:
Algorithms 5

Problems and Solutions algorithms  
Week 12
Nov 12-15
Contradiction chapter 17 contradiction 1
contradiction 2
contradiction 1
contradiction 2
Problems and Solutions contradiction  
Week 13
Nov 18-22

State Diagrams

chapter 19 state diagrams 1
state diagrams 2
state diagrams 3
State Diagrams 1
State Diagrams 2
State Diagrams 3
Problems state diagrams  
Fall break
Nov 23-Dec 1
 
Week 14
Dec 2-6
Countability chapter 20 countability 1
countability 2
countability 3
countability 4
Countability 1
Countability 2
Countability 3
Countability 4
  countability  
Week 15
Dec 9-11
  no tutorial
Finals Week   Sign up on PrairieTest