Lecture 16

We did

• Huffman codes: an example of using trees for a fun purpose
• Review of context-free grammar notation
• Two tree induction proofs: one involving a grammar, one the example from 1.38.

Announcements

• The world was down this morning, as in most of the computer services locally. Seems to have gone down after the reading quiz was due, and come back up during our lecture. So probably no effect on our assignments. Of course, that assumes that the mystery reason for the outage is really now fixed!