Let the frequency of letters a, b, c, d, and e be as follows: 7, 16, 25, 17 and 20.
Assume you build a huffman code to create an optimal prefix code.
Indicate all the correct answers.

Question

Let the frequency of letters a, b, c, d, and e be as follows: 7, 16, 25, 17 and 20.  
 Assume you build a huffman code to create an optimal prefix code. 
 Indicate all the correct answers.

Answer

Huffman coding minimizes the maximum codeword length

Answer

For a given alphabet  X , Huffman code minimizes the sum, over all the leaves of the tree, of frequency( x ) x depth(a), where frequency( x ) is the frequency of  x  and depth( x ) is the depth of the node associated with  x  in the Huffman tree

Answer

There is an ordering of the input data for which 11 is a Huffman coding for letter c

Answer

Is the following encoding a Huffman code: 
 a: 100, b: 101, c:01, d:00, e:11

Answer

There is an ordering of the input data for which 10 is a Huffman coding for letter c

Answer

Huffman code minimizes the average codeword length

Answer

Is the following encoding a Huffman code: 
 a: 101, b: 100, c:11, d:00, e:01

Crowdly

Let the frequency of letters a, b, c, d, and e be as follows: 7, 16, 25, 17 and ...

Want instant access to all verified answers on moodle.concordia.ca?