Question: Consider finding a prefix code for a file that consists of the letters a, b, c, d, and e. Suppose that these letters appear in
Consider finding a prefix code for a file that consists of the letters a, b, c, d, and e. Suppose that these letters appear in the file with the following frequencies.
f(a) = 20; f(b) = 7; f(c) = 10; f(d) = 4 and f(e) = 18:
Suppose each character was represented by four binary digits before compression. What is the total number of bits utilized by the data before compression? Apply the Huffman Encoding technique to compress the data and find the total number of bit required to represent the complete file after compression. What is percentage of space saved by the compression technique?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
