edited by
4,532 views
5 votes
5 votes

Huffman tree is constructed for the following data :$\{A,B,C,D,E\}$ with frequency $\{0.17,0.11,0.24,0.33\ \text{and} \ 0.15 \}$ respectively. $100\ 00\ 01101$ is decoded as

  1. $BACE$
  2. $CADE$
  3. $BAD$
  4. $CADD$
edited by

2 Answers

3 votes
3 votes

There's a typo in the huffman code. It should be 100 00 01 101.

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

100 - B
00 - A
01 - C
101 - E

BACE

Option A 

1 votes
1 votes

100 00 01101 is decoded as BACE

Answer:

Related questions

3 votes
3 votes
3 answers
1
10 votes
10 votes
3 answers
2
Satbir asked Jan 13, 2020
8,559 views
What is the complexity of the following code?sum=0; for(i=1;i<=n;i*=2) for(j=1;j<=n;j++) sum++;Which of the following is not a valid string?$O(n^2)$$O(n\log\ n)$$O(n)$$O(...
5 votes
5 votes
5 answers
3
Satbir asked Jan 13, 2020
7,672 views
If an array $A$ contains the items $10,4,7,23,67,12$ and $5$ in that order, what will be the resultant array $A$ after third pass of insertion sort?$67,12,10,5,4,7,23$$4,...
7 votes
7 votes
2 answers
4
Satbir asked Jan 13, 2020
3,173 views
In linear hashing, if blocking factor $bfr$, loading factor $i$ and file buckets $N$ are known, the number of records will be$cr= i+bfr+N$$r=i-bfr-N$$r=i+bfr-N$$r=i ^{\as...