Day 30 mat385

• Announcements:
  • If it's okay with all, let's push our next exam back a week (until 4/17). We haven't covered that much ground since the last one.
  • Homework for 5.2 is returned (graded #4, 21).
  • Homework for 5.3 (due next time)
  • Homework for 6.2:
    pp. 496, #1-4, 7, 9, 11, 13, 17, 20, 25, 27, 28 (due Wed, 4/8)

• Questions on things?

• We'll wrap up section 5.3: Decision Trees,

• Then start section 6.2: Euler Paths and Hamiltonian Circuits.

Links:

• Sir William Rowan Hamilton, 1805-1865
• Leonhard Euler, 1707-1783
• The paper which our author cites to dispute that Euler created graph theory to solve the Konigsberg bridge problem (one of the authors is the man who gave us the codon problem, Brian Hopkins; the other is the author of a wonderful book on Lewis Carroll).
• Traveling salesman problem
• www.cs.sunysb.edu/~algorith/files/traveling-salesman.shtml