Recent questions tagged huffman-code

0 0 votes
1 1 answer
137
137 views
Match the LIST-I with LIST-IILIST-ILIST-IIA.Dynamic programmingI.Floyd Warshall Shortest pathB.GreedyII.Huffman codingC.Back trackingIII.Hamiltonian cycle problemD.Branch...
0 0 votes
1 1 answer
438
438 views
The correct sequence of constructing Huffman tree isRepeat until root formedCreate leaf nodesBuild priority queueCombine lowest frequency nodesChoose the correct answer f...
1 1 vote
3 3 answers
574
574 views
Which of the following algorithms use Greedy strategy?Dijkstra's algorithmKruskal's algorithmHuffman codingBellman-Ford algorithmChoose the correct answer from the option...
1 1 vote
0 0 answers
415
415 views
Do we sort the frequencies in ascending order in while constructing Huffman encoding ?We get different answer if we follow input sequence and different when ordered seque...
0 0 votes
2 answers 2 answers
559
559 views
can someone please explain if the following queries are the same?1- Average length of the Huffman code2- Expected length of the encoded message3- What is the minimum leng...
1 1 vote
0 0 answers
439
439 views
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 confirmThe characte...
4 4 votes
2 2 answers
1.4k
1.4k views
Which of the following frequencies for A,B,C and D can generate the following Huffman tree? (Select all that apply.)$p_A=0.4, p_B=0.3, p_C=0.2, p_D=0.1$$p_A=0.35, p_B=0.2...
1 1 vote
1 1 answer
3.0k
3.0k views
consider the following message BCCABBDDAECCBBAEDDCC find the no of bits requiered for huffman encoding of above message
1 1 vote
1 1 answer
962
962 views
24 24 votes
4 4 answers
2.2k
2.2k views
Consider a source which outputs independent random letters from the alphabet $A=$ $\{a, b, c, d, e\}$ with probabilities $p_{a}=1 / 4, p_{b}=1 / 4, p_{c}=1 / 6, p_{d}=1 /...
1 1 vote
0 0 answers
735
735 views
A message is made up entirely of characters from the set $\text{X=\{P, Q, R, S, T\}}$. The table of probabilities for each of the characters is shown below:$$\begin{array...
0 0 votes
1 1 answer
596
596 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 ...
37 37 votes
4 answers 4 answers
22.8k
22.8k views
Consider the string $\textrm{abbccddeee}$. Each letter in the string must be assigned a binary code satisfying the following properties:For any two letters, the code assi...
9 9 votes
4 4 answers
9.2k
9.2k views
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...
0 0 votes
0 0 answers
895
895 views
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 wh...