Dark Mode

Recent questions tagged huffman-code

0 votes

1 answer

61

Prefix code
How to solve this ? I am getting 1111 , the given answer is 1011.

Rohit Mallik asked in Algorithms Dec 30, 2015

by Rohit Mallik

316 views

0 votes

1 answer

62

Please solve
. Consider the following message: aabbbbabccdddccccbbdd Find the number of bits required for Huffman encoding of the above message: (a) 30 (b) 38 (c) 42 (d) 46 Ans is c If Huffman tree coded as left child with ‘0’ and right child with ‘1’ from every node then what is the decoded message for 110100? (a) abc (b) bcd (c) acb (d) bda ans given is d

Gate Mm asked in Algorithms Dec 17, 2015

2.7k views

5 votes

4 answers

63

huffman coding
we use huffman encoding to encode a b c with frequency fa fb fc.Which of the following code sequence is not possible? code 1={0,10,11} code 2={0,00,1} code 3={10,00,01}

Pooja Palod asked in Algorithms Dec 3, 2015

2.9k views

0 votes

3 answers

64

How does huffman encoding involve the concept of build-heap algorithm ?
Though the parent node is maximum of both the child nodes but still the procedure we follow is chosing the minimum at each step and adding them to produce a parent node, so how come heapify procedure is called here ?

radha gogia asked in Algorithms Jun 29, 2015

741 views

0 votes

2 answers

65

plz answer !
consider the msg - aabbbbabccdddccccbbdd ques 1. the number of bits required for huffman encoding of the above msg is- a.38 b 30. c 42. d.46 ques 2. what is the decoded msg for 110100 1. abc 2 acb 3 bcd 4 bda

shreshtha5 asked in Algorithms Jun 26, 2015

1.0k views

32 votes

2 answers

66

GATE IT 2006 | Question: 48
The characters $a$ to $h$ have the set of frequencies based on the first $8$ Fibonacci numbers as follows $a : 1$, $b : 1$, $c : 2$, $d : 3$, $e : 5$, $f : 8$, $g : 13$, $h : 21$ A Huffman code is used to represent the characters. What is the sequence of characters corresponding to the following code? $110111100111010$ $fdheg$ $ecgdf$ $dchfg$ $fehdg$

Ishrat Jahan asked in Algorithms Oct 31, 2014

by Ishrat Jahan

12.9k views

29 votes

1 answer

67

GATE CSE 2007 | Question: 76
Suppose the letters $a, \,b, \,c, \,d, \,e, \,f$ have probabilities $\frac{1}{2}, \frac{1}{4}, \frac{1}{8}, \frac{1}{16}, \frac{1}{32}, \frac{1}{32}$, respectively. Which of the following is the Huffman code for the letter $a, \,b, \,c, \,d, \,e, \,f$? $0$ ... $011$, $010$, $001$, $000$ $11$, $10$, $01$, $001$, $0001$, $0000$ $110$, $100$, $010$, $000$, $001$, $111$

Kathleen asked in Algorithms Sep 21, 2014

10.8k views

Page:

« prev
1
2
3

Recent questions tagged huffman-code