home

• Part 1
  May 6-21
  • Propositions, if-then statements, and straightforward proofs (Resources: section 2)
  • Sets (Resources: section 3)
  • Non-constructive existence proofs (Resources: 4C)
  • Homework 1 due on Monday, May 11
    
    
  • Proof by contrapositive, by contradiction, and by smallest counterexample (Resources: 4A)
  • Homework 2 due on Wednesday, May 13
    
    
  • Pigeonhole principle (Resources: 4B)
  • Logic (Resources: section 5)
  • Homework 3 due on Friday, May 15
    
    
  • Proof by induction (Resources: 4D)
  • Homework 4 due on Sunday, May 17
    
    
  • Exam 1: Thursday, May 21, in the evening (probably around 6-8pm)
  
  
• Part 2
  May 22 - June 4
  • Summations (Resources: 6)
  • Big-O notation; exaggerating and simplifying (Resources: 7)
  • Homework 5 due on Tuesday, May 26
    
    
  • Recurrence relations using big-O (Resources: 8)
  • Homework 6 due on Thursday, May 28
    
    
  • Graphs: intro (Resources: 9A)
  • Cliques, Independent sets, Ramsey numbers (Resources: 9B)
  • Homework 7 due on Saturday, May 30
    
    
  • Connectivity and trees (Resources: 9C)
  • Minimum Spanning Trees (MST) (Resources: 9D)
  • Homework 8 due on Monday, June 1
    
    
  • Exam 2: Thursday, June 4
  
  
• Part 3
  June 5-18
  • Planarity (Resources: 9E)
  • Vertex coloring (Resources: 9F)
    
  • Homework 9 due on Tuesday, June 9
    
    
  • Combinatorics (Resources: 10)
  • Homework 10 due on Thursday, June 11
    
    
  • Probability intro (Resources: 11A)
  • Conditional probability (Resources: 11B)
  • Homework 11 due on Saturday, June 13
    
    
  • Random variables (Resources: 11C)
  • Indicator random variables (IRV) (Resources: 12D)
  • Homework 12 due on Monday, June 15
    
    
  • Exam 3: Thursday, June 18