Day 29: mat385

Today:

• The comprehensive final is Monday, May 5, from 6:45 - 8:45 p.m.
  • Half will concern chapter 7, and 8.2 (there's plenty of stuff!)
  • The rest will revisit previous material:
    • Chapters 1 and 2
    • 3.1-6
  • You will be allowed to skip one of the problems involving old material; you will not be allowed to skip one of the problems involving new material!
  • You will be allowed an 8.5x11 (inches!) sheet of paper, with anything at all on it.
  • Old finals:
    • Final, Spring 2002 (Key)
    • Final, Fall 2002 (Key)
    • Final, Fall 2003 (Key)
    • Final, Spring 2005 (Key)
    • Final, 2006 (Key)
    • Final, Fall 2007 (Key)

  • I am available for a study session Sunday evening, if there is "sufficient interest". As a possible alternative, I'll be around all day Monday (after 11:00), if you want to meet.

• 7.3 homework returned
  • #13/15
  • #17/19

• I'll be dropping your three worst homework grades. Section 8.2 homework will be optional, and serve as an additional homework replacement. Hand it in with the exam, if you wish.

• Josh rose to the challenge and solved Will Shortz's puzzle with which we began our tree unit:

  On March 13 2005, Will Shortz presented an interesting word puzzle on National Public Radio: rearrange the letters of K + ANALOGIES into a tree, where every path leading downward is a four-letter word.

• Questions about anything at all?

• Section 8.2 (pdf): Finite State Machines

• Wrapping up: the view from on high

• Evaluations