25 January 2012 (W):
minimum spanning trees.
Reading: §4.5–4.6. For optional
additional practice with greedy algorithms, read the remainder of
Our first prelim is scheduled for Monday, in
class. You may bring one 8.5"-by-11" crib sheet containing
notes that you have handwritten or typed yourself (no photocopying).
You may write on both sides of the paper, but don't
staple/tape/superglue/attach anything to the paper. I may ask you to
hand in your crib sheet with your exam. Any material up to and
including greedy algorithms (through 27 January 2011 [MSTs] in class, through
Problem Set 4, and Chapters 1–4) is fair game for the
Because of the meshing of the exam and ps4
scheduling, I'm giving you all another free late pass to use as you
please throughout the term. Enjoy!