Register

Virtual Gate Test Series: Algorithms - Huffman Coding

• edited by
645 views

1 Answer

0 0 votes
Ans=1.73

after drawing min heap huffman tree, would get the code lengths for each frequency. Thus, using the avg code length formula, will get the avg code length.
Voting & Accepting an answer helps improve the community
← Previous · Virtual Gate Test Se...Next → · Virtual Gate Test Se...
← Previous in category · Virtual Gate Test Se...Next in category → · Virtual Gate Test Se...
Position:
Show:

Related questions

0 0 votes
0 0 answers
899
899 views
BASANT KUMAR asked Dec 2, 2018
899 views
virtual gate(huffman coding)
We use Huffman's algorithm to obtain an encoding of alphabet {a, b, c} with frequencies fa, fb, fc. Which of the following codes cannot possibly be obtained (no matter wh...
1 1 vote
2 answers 2 answers
5.7k
5.7k views
Akash Kumar Roy asked Apr 26, 2018
5,670 views
Space complexity of Huffman coding
what is Space complexity of Huffman coding?
1 1 vote
0 0 answers
2.3k
2.3k views
sunil sarode asked Jan 27, 2018
2,305 views
Huffman Coding
Which of the following statements is/are correct?P:In Huffman Coding, the item with the second lowest probability is always at the leaf that is furthest from the rootQ: I...
1 1 vote
0 0 answers
739
739 views
Nau1994 asked Jan 26, 2018
739 views
Algorithm huffman coding ACE TEST