Day 21, Mat385

Last time Next time

Announcements
- Today's quiz will cover graphs and trees (but not decision trees).
- Next week, Wednesday, we have our second midterm exam. It will cover everything we've covered from 4.1 through 7.3 (or topic for today).
  You will be allowed a cheat sheet, as before. It will be stapled to the exam, as before.
- Congratulations to our own Joey Truitt, winner of this year's 2025 Adult and Transfer Center (ATC) Transfer Student of the Year Award.
Last time:
- We wrapped up section 6.3, decision trees. Then we covered Euler paths and Hamiltonian Circuits.
  Existence of either is often the question: it's easy to determine if there's an Euler path; determining whether there's a Hamiltonian circuit is tricky business!
  We were able to demonstrate that some Hamiltonian circuits were impossible using trees, symmetry, and exhaustion (considering all possible paths).
- Marked up
  - Section 6.3: Decision Trees.
  - Then we covered Section 7.2 (Euler Paths and Hamiltonian Circuits).
Today:
- We'll hit Section 7.3 (Shortest Paths and Minimal Spanning Trees).
- Then have a quiz....

Links:

Website maintained by Andy Long. Comments appreciated.

\[ S(n)=c^{n-1}S(1)+\sum_{i=2}^{n}c^{n-i}g(i) \]