Question: Given a set of characters A = {a1, a2, ...an}, where n > 2. Let fi and fj be the frequencies of ai and aj

Given a set of characters A = {a1, a2, ...an}, where n > 2. Let fi and fj be the frequencies of ai and aj , and di and dj be the depths of ai and aj in a Huffman encoding tree for A. Prove or disprove (by counter example) the following statement.

a. (5 marks) if di = dj then fi = fj .

b. (5 marks) if fi > fj then di dj.

Please help with these two questions.

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!