Register

consider the following message BCCABBDDAECCBBAEDDCC find the no of bits requiered for huffman encoding of above message

• retagged by
3,014 views

1 Answer

3 3 votes

Message : BCCABBDDAECCBBAEDDCC

The frequency of Alphabets in the message is :

A = 3, B = 5, C = 6, D = 4, E =2

 

The Huffman Tree will look like : 

 

             

 

So, the Huffman code assigned to each Alphabets are :

A – 011, |A| = 3

B – 10, |B| = 2

C – 11, |C| = 2

D – 00, |D| = 2

E – 010, |E| = 3

 

Total Number of Bits : 3 x 3 + 5 x 2 + 6 x 2 + 4 x 2 + 2 x 3 = 9 + 10 + 12 + 8 + 6 = 45.

 

 

• edited by
Voting & Accepting an answer helps improve the community
← Previous · NPTEL assignments li...Next → · NIELIT 2023 Feb Scie...
← Previous in category · Recurrence relationsNext in category → · algorithms
Position:
Show:

Related questions

0 0 votes
3 3 answers
1.5k
1.5k views
radha gogia asked Jun 29, 2015
1,467 views
How does huffman encoding involve the concept of build-heap algorithm ?
Though the parent node is maximum of both the child nodes but still the procedure we follow is chosing the minimum at each step and adding them to produce a parent node, ...
0 0 votes
0 0 answers
3.1k
3.1k views
Shaik Masthan asked Jul 26, 2018
3,106 views
self doubt on HUFFMAN
in Huffman Code, we get extract the minimum at each time, but my minimum is creating duplicate, then which one i choose?i am getting the same avg.no.of bits for every Huf...
2 2 votes
1 answers 1 answer
3.4k
3.4k views
jenny101 asked Oct 26, 2016
3,366 views
Huffman Encoding
Q29.4. A file contains the following characters and their corresponding frequencies as shown below:\[\mathrm{a}: 45, \mathrm{~b}: 13, \mathrm{c}: 12, \mathrm{~d}: 16, \ma...
1 1 vote
1 1 answer
983
983 views
h4kr asked Jan 10, 2023
983 views
Please draw the huffman diagram for the following question