edited by
2,730 views

1 Answer

Best answer
3 votes
3 votes

The Huffman tree looks like this. Then for message with probability 0.08 , it takes 3 bits, similarly multiply all the probabilities with the number of bits that respective message would take and summ them all up, so we get 2.45

selected by

Related questions

1 votes
1 votes
1 answer
1
piyushkr asked Jan 5, 2016
17,990 views
A file contains characters a,e,i,o,u,s and t with frequencies 10,15,12,3,4,13 and 1 respectively. If we use Huffman Coding for data compression then the average code leng...
0 votes
0 votes
1 answer
3
aaru14 asked Dec 2, 2017
6,470 views
question based on huffman coding for symbol A with probability 0.3 , B with 0.15 ,c with 0.1 ,D with 0.25 ,E with 0.2 (with the convention 0 labeled for left branch and 1...
0 votes
0 votes
1 answer
4
reena_kandari asked Jan 10, 2017
382 views