retagged by
379 views
0 votes
0 votes

Suppose letters a,b,c,d,e,f have probabilities ½, ¼, 1/8, 1/16, 1/32, 1/32. Which of the following is the Huffman code for the letters a,b,c,d,e,f.

  1. 0, 10, 110, 1110, 11110, 11111
  2. 11, 10, 01, 001, 0001, 0000
  3. 11, 10, 011, 010, 001, 000
  4. 110, 100, 010, 000, 001, 111
retagged by

Please log in or register to answer this question.

Answer:

Related questions

2 votes
2 votes
1 answer
1
Bikram asked Feb 9, 2017
840 views
Consider the following set of messages with their frequencies: $$\begin{array}{|c|c|c|} \hline \textbf{Message} & \textbf{Frequency} \\ \hline A & 50\: \text{million} \...
0 votes
0 votes
1 answer
3
Bikram asked Nov 26, 2016
1,638 views
Three algorithms do the same task. Algorithm One is $O(N)$ and Algorithm Two is $O(\log N)$ and Algorithm Three is $O(N1/2)$. Which algorithm should execute the fastest f...
1 votes
1 votes
3 answers
4