| Data Compression Review Part 1 |
| The following review questions were covered in Labs 02 and 03 and are questions taken from the course website. NOT ALL questions from the course website were discussed in lab. Please note that the information presented here does not necessarily represent a complete answer to the review question. The information is intended to spark student's memory for those who attended lab OR provide a base (hint) from where to start for those students who did not attend lab.
| Question 1: Encode the following message using Adaptive Huffman Compression: |
| "betty-better-butter-buds-bun" |
|  | See the java applet that was demo-ed in lab: Adaptive Huffman example |
| Question 2: Encode the following string using LZW compression: |
|  | "CAN YOU IMAGINE AN IMAGINARY MENAGERIE MANAGER IMAGINING MANAGING AN IMAGINARY MENAGERIE" |
| Question 3: Consider the following data for a static Huffman tree and draw the tree represented by the data |
|  | A bit sting representing a binary tree structure ( 1 = node exists, 0 = no node ) |
|  | 1111111110011000000000011000000 |
|  | A set of terminal symbols: |
|  | A B C D E F G |
| Question 4: Given the following encoded message and tree, decompress the message? |
|  | 01010010 00010011 01101111 11000100 01101011 01000101 11100001 01110001 10010111 10111111 1011100 |
|  | ALL LIES LEAD TO THE TRUTH |

BACK

© Copyright 2002
Questions? Please Email: gwen@cpsc.ucalgary.ca
Last modified October 28, 2002