| Date |
Topic |
Reading |
Notes |
Worksheet (if any) |
| Monday, Aug. 23 |
Course syllabus
Truth tables, propositions, logical equivalences, implications |
Sections 1.1, 1.2 |
Lecture 1 |
|
| Wednesday, Aug. 25 |
Truth tellers and liars |
Sections 1.1, 1.2 |
Lecture 2 |
Worksheet 1 |
| Friday, Aug. 27 |
Predicates and Quantifiers |
Sections 1.3, 1.4 |
Lecture 3 |
|
| Monday, Aug. 30 |
Proofs |
Section 1.6 |
Lecture 4 |
|
| Wednesday, Sept. 1 |
Proofs, Induction |
Sections 1.7 and 4.1 |
Lecture 5 |
|
| Friday, Sept. 3 |
Induction |
Sections 4.1, 4.2 |
|
Worksheet 2 |
| Wednesday, Sept. 8 |
Induction |
Sections 4.1, 4.2 |
Lecture 6 |
|
| Friday, Sept. 10 |
Induction |
Sections 4.1, 4.2 |
Lecture 7 |
|
| Monday, Sept. 13 |
Set Theory
Recap of induction worksheet |
Sections 2.1, 2.2 |
Lecture 8 |
|
| Wednesday, Sept. 15 |
Set Theory |
Sections 2.1, 2.2 |
Lecture 9 |
|
| Friday, Sept. 17 |
Set Theory
Functions |
Sections 2.2, 2.3 |
Lecture 10 |
Worksheet |
| Monday, Sept. 20 |
Class canceled |
|
|
|
| Wednesday, Sept. 22 |
Functions |
Section 2.3 |
Lecture 11 |
|
| Friday, Sept. 24 |
More Functions |
Section 2.3 |
Lecture 12 |
Worksheet |
| Monday, Sept. 27 |
Infinite Sets |
Section 2.4, 3.2 |
Lecture 13 |
|
| Wednesday, Sept. 29 |
Big-O Notation |
Section 3.2 |
Lecture 14 |
|
| Friday, Oct. 1 |
Review for midterm 1 |
|
|
|
| Monday, Oct. 4 |
Midterm 1 |
|
|
|
| Wednesday, Oct. 6 |
Big-O Notation |
Section 3.2 |
Lecture 15 |
|
| Friday, Oct. 8 |
Big-Omega
Big-Theta |
Section 3.2 |
Lecture 16 |
Worksheet |
| Monday, Oct. 11 |
Pseudocode |
Section 3.1 |
Lecture 17 |
|
| Wednesday, Oct. 13 |
Complexity of Algorithms |
Section 3.3 |
Lecture 18 |
|
| Friday, Oct. 15 |
Complexity |
Section 3.3 |
Lecture 19 |
Worksheet |
| Wednesday, Oct. 20 |
The Halting Problem
Intro to Recurrences |
Section 3.1, 7.1 |
Lecture 20 |
|
| Friday, Oct. 22 |
Recurrences |
Section 7.1 |
Lecture 21 |
|
| Monday, Oct. 25 |
Recurrences |
Section 7.1 |
Lecture 22 |
Worksheet |
| Wednesday, Oct. 27 |
Solving Linear Recurrences |
Section 7.2 |
Lecture 23 |
|
| Friday, Oct. 29 |
Solving Linear Recurrences part 2 |
Section 7.2 |
Lecture 24 |
|
| Wednesday, Nov. 3 |
Recursion Trees |
Section 7.3 |
Lecture 25 |
Worksheet |
| Friday, Nov. 5 |
Master Theorem |
Section 7.3 |
Lecture 26 |
|
| Monday, Nov. 8 |
Recursive Algorithms |
Section 7.3 |
Lecture 27 |
|
| Wednesday, Nov. 10 |
Counting |
Section 5.1 |
Lecture 28 |
|
| Friday, Nov. 12 |
Counting
Pigeonhole Principle |
Section 5.2 |
Lecture 29 |
|
| Monday, Nov. 15 |
Review Session |
|
|
|
| Wednesday, Nov. 17 |
Exam II |
|
|
|
| Friday, Nov. 19 |
No class |
|
|
|
| Monday, Nov. 22 |
Counting |
Section 5.3 |
Lecture 30 |
|
| Monday, Nov. 29 |
Graphs part 1 |
Chapter 9 |
Lecture 31 |
|
| Wednesday, Dec. 1 |
Graphs part 2 |
Chapter 9 |
Lecture 32 |
|
| Friday, Dec. 3 |
Graphs part 3 |
Chapter 9 |
Lecture 33 |
Worksheet |
| Monday, Dec. 6 |
Graphs part 4 |
Chapter 9 |
Lecture 34 |
|