closed by
496 views
0 votes
0 votes
closed as a duplicate of: 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 what the frequencies are)
Code 1 = {0, 10, 11}
Code 2 = {0, 1, 00}
Code 3 = {10, 01, 00}

(A) Only code 2
(B) Only code 2 and code 3
(C) Only code 1 and code 3
(D) None

answer given -(B)

why code 3 is incorrect??
closed by

Related questions

437
views
1 answers
0 votes
4.2k
views
2 answers
1 votes
Akash Kumar Roy asked Apr 26, 2018
4,201 views
what is Space complexity of Huffman coding?
1.6k
views
0 answers
1 votes
sunil sarode asked Jan 27, 2018
1,630 views
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: In ... is P and Q R is not always true and always word i missed :(
2.9k
views
3 answers
1 votes
Parshu gate asked Nov 16, 2017
2,919 views
The following message is: GATE2018GAATTTEEEE22000011188What is the average length of bits required for encoding each letter using Huffman coding___?