Day 21:
Mat385
Last time
: Finished Shortest path and Minimal path algorithms
Next time
: Logic Networks
Today
:
Collect Homework 6.2 and 6.3
finish up with
Section 6.4
(
pdf
): Traversal Algorithms
Section 7.1
(
pdf
): Boolean Algebras (up to p. 468)
For homework problem #2, use what you know about the max and min function as fluidly as you can (i.e. you don't need to justify anything "normal" about those operations).
Website maintained by
Andy Long
. Comments appreciated.