Math 308

Slides

Week 1

· Introduction (March 31)

• Sequences (April 1)
• The magic tables (about binary representation of integers)

· Induction (April 3)

· Recursion (April 4)

Week 2

· Counting1 (April 7)

· Counting2 (April 8)

· Counting3 (April 11)

Week 3

· Counting4 (April 17)

Week 4

· Counting5 (April 21)

· Graphs1 (April 22)

· Graph Applications (April 22)

· Graphs1appendix (optional) (April 24)

· Graphs2 (April 25)

Week 5

· Graphs2 more examples (May 1)

· Trees (May 2)

· Evolutionary trees (optional) (May 2)

Week 6

· Graph coloring (May 6)

· Discrete Optimization (May 8)

· Efficiency of algorithms 1 (May 9)

Week 7

· Efficiency of algorithms 2 (May 13)

· Efficiency of algorithms 3 (May 16)

Week 8

· Maximum flow problem (May 19)

· Minimum cut problem (May 20)

· Applications of Max Flow (May 22)

· Baseball Elimination Problem (May 23)

Week 10

· Integer programming (June 2)