| Date |
Topic |
Reading |
Notes |
Worksheet (if any) |
| Jan 11 |
Truth tables, propositions, logical equivalences, implications |
Sections 1.1, 1.2 |
Lecture 1 |
|
| Jan 13 |
Truth tellers and liars, predicates, quantifiers |
Section 1.3, 1.4 |
Lecture 2 |
|
| Jan 15 |
Direct Proof, Proof by Cases, Proof by Contradiction |
Section 1.5 |
Lecture 3 |
Worksheet |
| Jan 18 |
No class - MLK day |
|
|
|
| Jan 20 |
Proof by cases, proof by contradiction |
Section 1.5 |
Lecture 4 |
|
| Jan 22 |
Induction proofs |
Section 4.1 |
Lecture 5 |
Worksheet |
| Jan 25 |
Induction proofs part 2 |
Section 4.1 |
Lecture 6 |
|
| Jan 27 |
Strong Induction |
Section 4.1 |
Lecture 7 |
Worksheet |
| Jan 29 |
Sets |
Section 2.1 |
Lecture 8 |
|
| Feb. 1 |
Sets part 2 |
Section 2.1-2.2 |
Lecture 9 |
|
| Feb 3 |
Sets part 3 |
Section 2.2 |
Lecture 10 |
Worksheet |
| Feb 5 |
Functions |
Section 2.3 |
Lecture 11 |
|
| Feb. 8 |
More functions |
Section 2.3 |
Lecture 12 |
Worksheet |
| Feb 10 |
Infinite Sets |
Section 2.4 |
Lecture 13 |
Worksheet 5 revisited |
| Feb 12 |
Big-Oh Notation |
Section 3.2 |
Lecture 14 |
|
| Feb. 15 |
Review session |
|
|
|
| Feb 17 |
Midterm 1 |
|
|
|
| Feb 19 |
Big-Oh Notation part 2 |
Section 3.2 |
Lecture 15 |
|
| Feb. 22 |
Big-Omega and Big-Theta notation |
Section 3.2 |
Lecture 16 |
Worksheet |
| Feb 24 |
Pseudocode |
Section 3.1 |
Lecture 17 |
|
| Feb 26 |
Complexity of Algorithms |
Section 3.3 |
Lecture 18 |
|
| March 1 |
Halting Problem |
Section 3.1 |
Lecture 19 |
Worksheet |
| March 3 |
Recurrence relations |
Section 4.3 |
Lecture 20 |
|
| March 5 |
More recurrences |
Section 4.3 |
Lecture 21 |
|
| March 15 |
Recursive Algorithms |
Section 4.4 |
Lecture 22 |
Worksheet |
| March 17 |
Recurrence relations |
Section 7.2 |
Lecture 23 |
|
| March 19 |
More recurrences |
Section 7.3
Lecture notes on recurrences |
Lecture 24 |
|
| March 22 |
Recursion Trees |
Section 7.4 Lecture notes on recurrences |
Lecture 25 |
|
| March 24 |
Master Theorem |
Section 7.4 Lecture notes on recurrences |
Lecture 26 |
Worksheet |
| March 26 |
Recursion tree recap Intro to counting |
Chapter 5.1 |
Lecture 27 |
|
| March 29 |
Review Session |
|
|
|
| March 31 |
Midterm 2 |
|
|
|
| April 2 |
No class |
Off for Good Friday |
|
|
| April 5 |
No class |
Off for Easter Monday |
|
|
| April 7 |
Counting and Pigenhole |
Chapter 5.1, 5.2 |
Lecture 28 |
|
| April 9 |
Permutations and Combinations |
Chapter 5.3, 5.4 |
Lecture 29 |
|
| April 12 |
Binomial Theorem |
Chapter 5.4 |
Lecture 30 |
Worksheet |
| April 14 |
Generalized Permutations and Combinations |
Chapter 5.5 |
Lecture 31 |
|
| April 16 |
Generalized Permutations and Combinations |
Chapter 5.5 |
Lecture 32 |
Worksheet |
| April 19 |
Graphs |
Chapter 9 |
Lecture 33 |
|
| April 21 |
Graphs |
Chapter 9 |
Lecture 34 |
|
| April 23 |
Graphs: Hamiltonian Paths and cycles |
Chapter 9 |
|
Worksheet |