Second Project, mat385:
Huffman Trees

You may work with a partner (no teams of three or larger).
You will
- Read section 5.4: Huffman Codes
- Find an interesting piece of text (e.g. a poem or story), or an image that you will compress.
- Create a Huffman encoding tree to compress your file.
- Your "report" will be documented on the our wiki, at norsemathology.org. Here are example topic headings.
  The description should include at least the equivalent of two typed, double-spaced pages including
  - something about the problem you're examining,
  - a description of the file you're working on (with a link to the file),
  - a frequency analysis of your text or image,
  - a graph illustrating a tree,
  - a copy of your compressed file, and a comparison of your compressed file against other compression algorithms (e.g. zip, gzip).
As soon as you have a partner (or not), email me. When you have your file, let me know that, too.

Website maintained by Andy Long. Comments appreciated.