• edited by
449 views
1 1 vote

the answer to the question is given as option c but when I am solving, it is coming as option a. Is the answer wrong? Am I solving incorrectly? Please confirm

The characters a to $h$ have the set of frequencies based on the first 8 Fibonacci numbers as follows: a: $1, \mathrm{~b}: 1, \mathrm{c}: 2, \mathrm{~d}: 3, \mathrm{e}: 5, \mathrm{f}: 8, \mathrm{~g}: 13, \mathrm{~h}: 21$ A Huffman code is used to represent the characters. What is the sequence of characters corresponding to the following code?
\[
110111100111010
\]
(a) fdheg
(b) ecgdf
(c) dchfg
(c) fehdg

Please log in or register to answer this question.

Position:
Show:

Related questions

2 2 votes
1 1 answer
543
543 views
Hira Thakur asked Aug 14, 2016
543 views
cosider following set of frequeciesmessage frequenciesa ...
0 0 votes
1 1 answer
606
606 views
Shraddha dwevedi asked Nov 24, 2021
606 views
Q.which of the following data structure cannot be used for efficient implementation of Huffman encoding? a. Binary min heapb. Binary max heapc. AVL tree (height balanced ...
0 0 votes
1 answers 1 answer
687
687 views
srishtipandey420 asked Jun 20, 2024
687 views
How can we solve this recurrance relation using master's theorem? T(n)=2 * T (n/2) + nlogn
–2 –2 votes
1 1 answer
1.6k
1.6k views
ARUN KUMAR 3 asked Dec 2, 2016
1,584 views
Consider the following language:L={an bm cm dn n,m >=1}What is the minimum yield of the above language ? (From equivalent parse tree)(a) abcd (b) aaabbbcccddd...