Question: Analysis of Algorithm Suppose a file contains 3000 characters consisting of characters a (10), b (15), c (20), d (5), e (22) and f (28).

Analysis of Algorithm

Suppose a file contains 3000 characters consisting of characters a (10), b (15), c (20), d (5), e (22) and f (28). The number inside the parenthesis represents the frequency of that character.

(a) Draw the optimal prefix code tree. (b) What is the average bits per letter of the prefix code in (a)? (c) What is the size of the file after data compression?

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!