Explore BrainMass
Share

Huffman tree

This content was STOLEN from BrainMass.com - View the original, and get the already-completed solution here!

Hi

Please find correct answer and explain.

Question:

Consider the Huffman tree where the character frequencies are: Freq(A)=16, Freq(B)=8; Freq(C)=4;Freq(D)=2;Freq(E)=1;Freq(F)=1. The total length of the encoding with the above frequencies and the derived Huffman tree is:

Answers:

a) 62
b) 63
c) 64
d) 30
e) 31

Thanks

Annie

© BrainMass Inc. brainmass.com October 24, 2018, 6:42 pm ad1c9bdddf
https://brainmass.com/computer-science/trees/huffman-tree-46942

Solution Preview

The Huffman tree will be the following
32
...

Solution Summary

Huffman tree is modeled.

$2.19
See Also This Related BrainMass Solution

Construct an Optimal Huffman Code and Tree

Suppose characters a, b, c, d, e, f, g, h, i, j, k have probabilities 0.01, 0.03, 0.03, 0.05, 0.05, 0.07, 0.09, 0.12, 0.13, 0.20, 0.22, respectively. Construct an optimal Huffman code and draw the Huffman tree.

Use the following rules:
a. Left: 0, right: 1
b. For identical probabilities, group them from the left to right.

What is the average code length?

View Full Posting Details