Date  Day  #  Topics  Rosen  Story Time  I/O 

01/05  W  No class  
01/07  F  1  Overview  1.1, 1.2  
01/10  M  2  Propostional Logic  1.3, 1.4 
Leibniz –
On
Computers
Mechanical Calculators 
HW 1 Goals – Table 
01/12  W  3  Predicate Logic  1.5  Sir Belvedere's Logic  
01/13  Θ  4  Deduction  1.6 
Euclid's
Postulates Parallel Postulate Spherical – NonEuclid 

01/14  F  5  Proofs  1.7 
Riemann Hypothesis ζ Function – Clay 
Proofs 
01/17  M  MLK – No class 
HW 1 Due HW 2 

01/19  W  6  Proofs; Set theory  2.1, 2.2  BanachTarski Paradox  
01/20  Θ  7  Set Operations; Relations 
2.3, 8.1  Russell's Paradox (Also)  
01/21  F  8  Functions  2.4 
Gödel's Proof –
Outline
Book 

01/24  M  9  Sequences; Series  4.1 
Hilbert's Grand Hotel Cartoon – Souvenirs! 
HW 2 Due HW 3 
01/26  W  10  Induction  4.2  Gauss – Topics  Induction 
01/27  Θ  11  Strong Induction  5.1 
Cantor's Diagonalization Continuum Hypothesis 

01/28  F  12  Counting  5.3, 7.5  Cantor set and egg  
01/31  M  13  Combinations  5.2, 5.4 
Ignorantium Tides by Tao 
HW 3 Due HW 4 
02/02  W  14  Repetitions; Pigeonhole Midterm 1 (7  9 PM) 
5.5  
02/04  F  15  Algorithm; BigO  3.1, 3.2  AlKhwarizmi – Algebra  
02/07  M  16  Logarithm; BigΩ BigΘ  3.3  Logarithms 
Midterms HW 4 Due HW 5 – MIF 
02/09  W  17 
Binary search Insertion sort Recurrence relations 
4.4 
How to use
a slide rule
Sold out! 

02/10  Θ  18 
Merge Sort, Quicksort Discrete Probability 
6.1 
Halting
Problem
CS 4 Notes 

02/11  F  Carnival – No class  
02/14  M  19 
Conditional probability Random Variables 
6.2 
Turing
machine ChurchTuring Thesis Turing Prize 
HW 5 Due HW 6 (Probability) 
02/16  W  20  Expectation; Bernoulli  6.4  Watson on Jeopardy!  
02/17  Θ  21  Properties; Variance  6.3  Bertrand's Paradox  
02/18  F  22  Chebyshev; Bayes 
Monty
Hall Problem Afra's Report 

02/21  M  23 
Average case Hashing 
9.1 
St. Petersburg
Paradox Philosophy 
HW 6 Due HW 7 
02/22  T 
Midterm 2 Review by TAs Milka & Ryan 
Problems Solutions 

02/23  W  24 
Chaining; Graphs Midterm 2 (7  9 PM) 
9.2, 9.3 
PseudoRandom Random! – Cheat! 

02/25  F  25 
Bipartite; Subgraph Isomorphism 
9.4 
Bridges
of Königsberg
Paper E53 

02/28  M  26 
Invariants; Connectivity Dijkstra 
9.6 
P vs NP
(Clay) – Zoo
CS 4 Notes – Map 
Midterms HW 7 Due HW 8 
03/02  W  27  Trees  10.1 
Four
Color Theorem (Also) – Proof 

03/04  F  28 
Sorting lower bound Prefix codes 
4.3, 10.2  Paul Erdős – Number  
03/07  M  29  Last Lecture  HW 8 Due  
03/09  W  No class  
03/10  Θ  Final Review by TAs Ryan & Milka 
Problems Solutions 

03/12  S 
Final 8  11 am
Kemeny 006 