Math 308

Slides

Week 1

· Introduction (March 30)

• Sequences (March 31)
• The magic tables (about binary representation of integers)
• Induction (April 2)
• Recursion (April 3)

Week 2

· Counting1 (April 6)

· Counting2 (April 7)

· Counting3 (April 9)

Week 3

· Counting4 (April 13)

· Counting5 (April 17)

Week 4

· Graphs1 (April 20)

· Graph Applications (April 20)

· Graphs1appendix (optional) (April 21)

· Graphs2 (April 23)

· Graphs2 more examples (April 23)

Week 5

· Trees (April 30)

· Evolutionary trees (optional) (April 30)

Week 6

· Graph coloring (May 4)

· Discrete Optimization (May 5)

· Efficiency of algorithms 1 (May 7)

· Efficiency of algorithms 2 (May 8)

Week 7

· Efficiency of algorithms 3 (May 11)

· Maximum flow problem (May 15)

Week 8

· Minimum cut problem (May 18)

· Applications of Max Flow (May 19)

· Baseball Elimination Problem (May 21)

· Integer programming (May 22)