Assignment:1 – Data Compression

Hand written solutions to be submitted by Friday – 27th January, 2023.

Q-1: Construct a Huffman tree and provide the encoded bit sequence of each characters in the
given table:

Character Frequency
A 05
B 25
C 37
D 15
E 30
F 13

Q-2: Use Huffman encoding to compress the following set of characters:

MULTIMEDIA COMMUNICATION
Provide the Huffman encoded output. Compare the memory required to store these characters
before and after compression.

Q-3: Use Arithmetic coding to compress and decompress the word ‘ENGINEERED’.

Q-4: Use Arithmetic coding to compress and decompress the word ‘ENGINE’.

Q-5: Use LZW encoding to compress and decompress the string ‘abcacbabaa’.

Rubrics:
1. Understanding of the problem.
2. Problem solving strategy.
3. Completeness of the solution.
4. Accuracy of the solution.
5. Justification of findings.