Day 18: mat385

Last time: Sehnert Lecture

Next time: section 6.2

Today:

Announcements
- I'm collecting 5.1 homework today.
- Test revisions are returned. Great job, overall.
- Homework 3.1 returned:
  - 14 -- hey, what's wrong with real numbers?
  - 33
    - b. Ugh: the natural numbers don't contain 0 (our author's bad).
    - d. Not unary -- "domain" too large
    - g. binary or not?
  - 89 - Russell's paradox
- Projects are being "graded", but not finished yet.
- How did you enjoy the Sehnert Lecture?
- A couple of questions motivated by the lecture:
  - Suppose that a team has five starting pitchers and two catchers: what type of graph might be appropriate to indicate all possible combinations of pitcher/catcher that start a game?
  - How could one use elements of graph theory to analyze the social dynamics of a team? That is, how well the team gets along?
    - What sort of graph would you use to store the data?
    - What computer representation would likely be most efficient?
Last time we looked at section 5.2: Trees and their representations
Today we'll check out section 5.3: Decision Trees

Website maintained by Andy Long. Comments appreciated.