search
Log In

Recent questions tagged huffman-code

3 votes
2 answers
1
Huffman tree is constructed for the following data :$\{A,B,C,D,E\}$ with frequency $\{0.17,0.11,0.24,0.33\ \text{and} \ 0.15 \}$ respectively. $100\ 00\ 01101$ is decoded as $BACE$ $CADE$ $BAD$ $CADD$
asked Jan 13 in Algorithms Satbir 577 views
0 votes
0 answers
2
in Huffman Code, we get extract the minimum at each time, but my minimum is creating duplicate, then which one i choose? i am getting the same avg.no.of bits for every Huffman tree, but the problem is my tree is changing therefore representing the character also changed, if some one asks convert the message ... $\frac{12}{30} $
asked Jul 26, 2018 in Algorithms Shaik Masthan 250 views
0 votes
1 answer
3
Consider the following message: The number of bits required for huffman encoding of the above message are __________? My Strategy:- But the answer given is 52bits i used standard Algorithem Made Easy Solution :-
asked Apr 30, 2018 in Algorithms Na462 601 views
1 vote
0 answers
5
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 root Q: In Huffman Coding, the item with the highest probability is always at the leaf that is closest to the root R: In ... at a leaf that is the child of the root Edit :Answer is P and Q R is not always true and always word i missed :(
asked Jan 27, 2018 in Algorithms sunil sarode 515 views
1 vote
0 answers
6
************ ****** is trying to send a message to Anand. The following message is: GATE2018GAATTTEEEE22000011188 What is the average length of bits required for encoding each letter using Huffman coding___? given solution : My solution using min heap ? I am ... char have same frequency ,does we get more than one tree and hence more than one solution? sorry if it is naive and already discussed
asked Dec 28, 2017 in Algorithms sunil sarode 470 views
0 votes
1 answer
7
question based on huffman coding for symbol A with probability 0.3 , B with 0.15 ,c with 0.1 ,D with 0.25 ,E with 0.2 (with the convention 0 labeled for left branch and 1 for right) the minimum no of bits required to represent all the symbols together is?? a)1 b)2 c)3 d)4 which bit this question asking??
asked Dec 3, 2017 in Algorithms aaru14 1k views
1 vote
3 answers
8
The following message is: GATE2018GAATTTEEEE22000011188 What is the average length of bits required for encoding each letter using Huffman coding___?
asked Nov 17, 2017 in Algorithms Parshu gate 825 views
1 vote
2 answers
9
how to find the comparision complexities in huffman coding algorithm?
asked Jul 3, 2017 in Algorithms akankshadewangan24 497 views
1 vote
1 answer
10
What would be huffman coding for following : Character Frequency a 10 l 15 i 12 o 3 u 4 s 13 t 1 Explain this with suitable diagram..
asked May 21, 2017 in Algorithms Anup patel 310 views
1 vote
1 answer
11
A zero memory source emits six messages with probabilities 0.3, 0.25, 0.15, 0.12, 0.1 and 0.08. If binary Huffman coding is used, what will be the average code length? a) 2.45 bits b) 3.45 bits c) 2.54 bits d) 3.54 bits
asked Feb 28, 2017 in Computer Networks sh!va 460 views
28 votes
4 answers
12
A message is made up entirely of characters from the set $X=\{P, Q, R, S, T\}$. The table of probabilities for each of the characters is shown below:$\begin{array}{|c|c|}\hline \textbf{Character} & \textbf{Probability } \\\hline \text{$ ... $100$ characters over $X$ is encoded using Huffman coding, then the expected length of the encoded message in bits is ______.
asked Feb 14, 2017 in Algorithms Arjun 6.3k views
3 votes
2 answers
13
What is the time complexity of Huffman coding using heap tree data structure ? a) O(n) b) O(n log n) c) O(log n) d) O(n2)
asked Jan 16, 2017 in Algorithms srestha 1.3k views
0 votes
2 answers
14
The following data contains 100 symbols. If Huffman coding is applied to the given data What is the code for the letter ‘E’ if ‘0’ as taken left and ‘1’ is right A. 101 B. 100 C. 110 D. 111
asked Dec 30, 2016 in Algorithms Anup patel 499 views
0 votes
2 answers
15
The following data contains 100 symbols. If Huffman coding is applied to the given data Calculate the number of bits occupies after compress the data. A. 128 B. 285 C. 200 D. 150
asked Dec 30, 2016 in Algorithms Anup patel 495 views
5 votes
2 answers
17
A language uses an alphabet of six letters, $\left\{a, b, c, d, e, f\right\}$ ... Design a prefix binary code for the language which would minimize the average length of the encoded words of the language.
asked Dec 16, 2016 in Algorithms makhdoom ghaya 778 views
2 votes
1 answer
18
asked Oct 26, 2016 in Algorithms jenny101 1.3k views
3 votes
3 answers
19
Consider a source with symbols $A, B, C, D$ with probabilities $1/2, 1/4, 1/8, 1/8$ respectively. What is the average number of bits per symbol for the Huffman code generated from above information? $2$ bits per symbol $1.75$ bits per symbol $1.50$ bits per symbol $1.25$ bits per symbol
asked Aug 21, 2016 in Algorithms jothee 2.2k views
1 vote
2 answers
20
Match the following: $\begin{array}{|ll|ll|} \hline a. & \text{Huffman Code} & i. & \text{$O(n^2)$} \\\hline b. & \text{Optical Polygon Tringulation} & ii. & \text{$\theta(n^2)$} \\ \hline c. & \text{Activity Selection Problem} & iii. & \text{$ ... a-i, b-ii, c-iv, d-iii a-i, b-iv, c-ii, d-iii a-iii, b-ii, c-iv, d-i a-iii, b-iv, c-ii, d-i
asked Aug 20, 2016 in Algorithms jothee 877 views
2 votes
2 answers
21
Given the symbols A, B, C, D, E, F, G and H with the probabilities$\frac{1}{30}, \frac{1}{30}, \frac{1}{30}, \frac{2}{30}, \frac{3}{30}, \frac{5}{30}, \frac{5}{30}$ and $\frac{12}{30}$respectively. The average Huffman code size in bits per symbol is $\frac{67}{30}$ $\frac{70}{34}$ $\frac{76}{30}$ $\frac{78}{30}$
asked Aug 2, 2016 in Algorithms jothee 3.3k views
1 vote
1 answer
22
A data file of 1,00,000 characters contains only the characters g-1, with the frequencies as indicated in table: g h i j k i Frequency in thousand 45 13 12 16 9 5 ... using the variable-length code by Huffman codes, the file can be encoded with 2,52,000 bits 2,64,000 bits 2,46,000 bits 2,24,000 bits
asked Jul 16, 2016 in Computer Networks jothee 1.4k views
25 votes
3 answers
23
Suppose the letters $a, \,b, \,c, \,d, \,e, \,f$ have probabilities $\dfrac{1}{2}, \dfrac{1}{4}, \dfrac{1}{8}, \dfrac{1}{16}, \dfrac{1}{32}, \dfrac{1}{32}$, respectively. What is the average length of the Huffman code for the letters $a, \,b, \,c, \,d, \,e, \,f$? $3$ $2.1875$ $2.25$ $1.9375$
asked Apr 23, 2016 in Algorithms jothee 3.1k views
0 votes
2 answers
24
Alice needs to send a large message to Bob using only five words. Seeing that the message is too long she decides to compress the message using Huffman coding algorithm. If the respective frequencies of words are given in the table, what would be the hamming code for w3 w1 w2 that she was supposed to use? a 100011011 b 100011101 c 100001101 d 111011000
asked Feb 3, 2016 in Algorithms khushtak 313 views
1 vote
1 answer
25
asked Jan 14, 2016 in Algorithms bahirNaik 142 views
1 vote
1 answer
26
A file contains characters a,e,i,o,u,s and t with frequencies 10,15,12,3,4,13 and 1 respectively. If we use Huffman Coding for data compression then the average code length will be - a) 140/58 b) 146/58 c) 150/58 d) 174/58
asked Jan 5, 2016 in Algorithms piyushkr 5.5k views
To see more, click for the full list of questions or popular tags.
...