Day 24, Mat385

Last time

Next time

• Announcements
  • Today we start chapter 8, with section 8.1; we have four more sections to cover and we're done!

  • RE projects: make sure that you send things to me via the correct email: some of you have been sending things to another Andrew Long....

    Any issues with the wiki?

  • Your exams are returned:
    • The exam
    • Curve: add 4 points to your score
    • Median: 75% (after the curve)
    • The Key
    • I'll replace your lowest midterm with the final, assuming it's better.

  • Our quiz this week will be over the material we cover today.

• Last time:
  • Prior to our exam we finished up Section 7.3 (Shortest Paths and Minimal Spanning Trees) with one more algorithm: Floyd's algorithm, which operates on adjacency matrices to produce a matrix of distances from any node to any other node (but no path information).

• Today:
  • We're going to go over section 8.1: Boolean Algebras

• Dijkstra and Bellmon-Ford Worksheet
• Dijkstra and Floyd's algorithm Worksheet
• Some Fun, Motivating Examples from Propositional and Predicate Calculus