Parallel Computing

Links

• UNIX_Ten_Commands.pdf
• PuTTY ssh remote.tjhsst.edu
• Kernighan and Ritchie book
• usb.txt

Huffman Compression

Code

• fread
• buffer
• time
• rand
• fscanf
• profile

Data

• decode me
• Mark Twain
• Moby Dick

TO DO

• Build an array-based binary tree using each symbol's codeword.
• Then, walk that tree (again and again) to decode the message.
• Not counting any of the overhead bits, calculate the ratio of...
• ...decoded (i.e., ASCII) bits minus encoded bits, to decoded bits.
• Calculate the theoretical (Shannon) minimum number of bits to
• encode this message with any scheme. How close was Huffman?
• minimum number of bits = SUM(frequency * -log2(probability))
• ...
• Now instead start with plain text and encode it using Huffman.
• TreeNode