GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 1

Answer 1

In Huffman’s algorithm, the character with the highest probability (all probabilities are unique) is guaranteed to be one of the leaves that is closest to the root (i.e it has the least depth among all leaves).

True
https://hkn.eecs.berkeley.edu/examfiles/cs170_fa07_mt2_sol.pdf

if all characters occur with a probability less than $1/3,$ then there is guaranteed to be no codeword of length $1.$

True
https://inst.eecs.berkeley.edu/~cs170/fa18/assets/dis/dis05-sol.pdf

Comments

@Sachin Mittal 1 @GO Classes For s2 if there are only 3 characters then one of them is guaranteed to have a codeword of length 1. How is it true then??

---

clearly said prob < 1/3 which means at least 4 chars are there...