Day 19, Mat385

Last time

Next time

• Announcements
  • The quiz today is over sets.

• Last time:
  • We wrapped up graphs, with a focus on the computer representation of them (adjacency matrices versus lists); sparcity and whether they are directed or not are a couple of the concerns.
  • Then we began section 6.2, trees, which are specialized types of graphs (acyclic, connected graphs with a priviledged node called the root).

    Because trees often contain an asymmetry in the form of "right" versus "left" branches, they violate one of our rules of graphs -- that you can pick them up, spin them around, and plunk them down in some other projection and you've still got the same graph.

  • Marked up
    • highlights from 6.1
    • highlights from 6.2

• Today:
  • We'll wrap up Section 6.2 (Trees).

  • Then we'll hit Section 6.3: Decision Trees.

  • Then we'll have a quiz.

• Some Fun, Motivating Examples from Propositional and Predicate Calculus