| Date |
Day |
# |
Lecture Topic |
Story Time |
I/O |
| 01/05 |
F |
1 |
Overview. Sets |
Banach-Tarski Paradox |
|
| 01/08 |
M |
2 |
Set operations. Relations |
Russell's Paradox (Also) |
|
| 01/10 |
W |
3 |
Equivalence Relations. Functions |
|
Homework & Grading Policy
Homework 1 |
| 01/12 |
F |
4 |
Function Types |
Cantor's Diagonalization |
Reading: 1.1 & 1.2 |
| 01/15 |
M |
|
MLK Holiday &ndash No Class |
|
|
| 01/17 |
W |
5 |
Counting |
Hilbert's Grand Hotel
|
Reading: 1.3, 1.4 up to multisets
Homework One Due
Homework Two
|
| 01/18 |
Th |
6 |
MLK x-hour – Binomial Coefficients. Propositional Logic
|
Pascal's Triangle |
|
| 01/19 |
F |
7 |
Propositional Logic |
|
Reading 3.1, 3.2 |
| 01/22 |
M |
8 |
Predicate Logic |
Sir Belvedere's Logic |
Reading 3.3, 4.1 |
| 01/24 |
W |
9 |
Quantifier Rules; Induction |
Gödel's Proof -
Outline -
Book
|
Homework Two Due
Homework Three
|
| 01/25 |
Th |
10 |
Induction; Strong Induction. |
|
Reading: 4.2 |
| 01/26 |
F |
|
No Class &ndash Afra MIA |
|
|
| 01/29 |
M |
11 |
First Order Linear Recurrences |
|
Homework Three Due
Homework Four
Reading: 4.3,
CLRS 3.1 (Handout)
|
| 01/31 |
W |
12 |
Recursion Trees |
Napier's Logs |
Reading: 4.4
1st Midterm 7-9 PM
Moore B03 |
| 02/02 |
F |
13 |
The Master Theorem |
Al-Khwarizmi |
Reading: 4.5 |
| 02/05 |
M |
14 |
The Master Theorem; Inequalities |
Strassen's Algorithm
|
Homework Four Due
Homework Five |
| 02/07 |
W |
15 |
Midterm Review; Final Recurrences |
|
|
| 02/08 |
Th |
16 |
Carnival x-hour -- Probability
|
Bertrand's Paradox
|
Reading: 5.1, 5.2
Mid-term Feedback Results
|
| 02/09 |
F |
|
Carnival Holiday &ndash No Class |
|
|
| 02/12 |
M |
17 |
Inclusion-Exclusion &ndash Prof. Pomerance |
|
Homework Five Due
Homework Six |
| 02/14 |
W |
|
Snowstorm &ndash No Class |
|
|
| 02/16 |
F |
18 |
Conditional Probability &ndash Raz |
The Monty Hall Problem |
Reading: 5.3 |
| 02/19 |
M |
19 |
Random Variables |
|
Reading: 5.4 |
| 02/21 |
W |
20 |
Bernoulli Trials |
Monty Hall Redux |
Homework Six Due
Homework Seven
Reading: 5.7 |
| 02/22 |
Th |
21 |
Snowstorm x-hour -- Variance |
|
Recitation 7-9 PM Sudikoff 115 |
| 02/23 |
F |
22 |
Variance, Central Limit Theorem |
Pseudo-Random Numbers |
2nd Midterm 7-9 PM
Moore B03 |
| 02/26 |
M |
23 |
Graphs |
Paul Erdös &ndash Erdös Number Project |
Reading: 5.6, 6.1 |
| 02/28 |
W |
24 |
Graph Isomorphism, connectivity |
P vs. NP – Clay |
Homework Seven Due
Homework Eight
|
| 03/02 |
F |
25 |
Euler Paths & Circuits &ndash Raz |
Seven Bridges of Konigsberg
– The Euler Archive @ Dartmouth
|
Reading: 6.3 |
| 03/05 |
M |
26 |
Hamiltonian Paths & Circuits; Trees |
The Hungarians: Lovasz, Szemerédi, Pach, Bollobás, Tóth, Füredi,... |
|
| 03/07 |
W |
27 |
Lower bound on sorting, Huffman codes |
Four Color Theorem (Also) |
Homework Eight Due |
| 03/10 |
S |
|
Final 3 &ndash 6 PM
Sudikoff 115 |
|
|
Computer Science