Last time: Finished 6.3: Shortest path
and Minimal spanning tree
Today:
- Return Section 6.2 homework:
- Questions on Section 6.3?
- Collect homework Section 6.3 (or not! If you want to hold onto it until
Wednesday, that's fine).
And 6.4 homework and 7.1. homework will be due Monday.
-
Section
6.4: Traversal Algorithms
- Homework for 6.4 is mostly just more of the same!
- Section
7.1: Boolean Algebras
(Note: only part of this section is being studied - up to p. 468,
"Isomorphic Boolean Algebras")
Next time: section 7.2: Logic Networks
Website maintained by Andy Long.
Comments appreciated.
