UGC-NET | UGC-NET CS 2017 Nov - III | Question 35

Last Updated :
Discuss
Comments

A text is made up of the characters a, b, c, d, e each occurring with the probability 0.11, 0.40, 0.16, 0.09 and 0.24 respectively. The optimal Huffman coding technique will have the average length of:

2.40

2.16

2.26

2.15

This question is part of this quiz :

Top MCQs on Greedy Algorithms with Answers,UGC-NET CS 2017 Nov - III
Tags:
DSA Quiz
UGC-NET
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy