Skip to content
Related Articles

Related Articles

Algorithms | Greedy Algorithms | Question 4
  • Last Updated : 06 Mar, 2013
GeeksforGeeks - Summer Carnival Banner

In question #2, which of the following represents the word “dead”?
(A) 1011111100101
(B) 0100000011010
(C) Both A and B
(D) None of these

Answer: (C)

Explanation: The Huffman Tree generated is:
Huffman Tree

character   code-word
    f          0
    c          100
    d          101
    a          1100
    b          1101
    e          111

The word dead can be represented as:
101 111 1100 101
However, the alternative codeword can also be found by assigning 1 to the left edge and 0 to the right edge of the tree, i.e. dead can also be represented as:
010 000 0011 010
See here for more details of the algorithm.

Quiz of this Question

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.

My Personal Notes arrow_drop_up
Recommended Articles
Page :