Register

GO Classes DPP | Algorithm |Huffman coding

587 views
3 3 votes

A file contains the following characters with the given frequencies:

  • a: $45$
  • b: $13$
  • c: $12$
  • d: $16$
  • e: $9$
  • f: $5$

What is the total number of bits required to encode the message 'bad' using a Huffman code generated from these frequencies?

  1. $9$
     
  2. $7$
     
  3. $6$
     
  4. $8$

3 Answers

1 1 vote



b: 101
a: 0
d: 111

Total = 7 bits

Voting & Accepting an answer helps improve the community
← Previous · GO Classes DPP | Alg...Next → · COA , IO DMA tranfer
← Previous in category · GO Classes DPP | Alg...Next in category → · GO Classes DPP | Alg...
Position:
Show:

Related questions

3 3 votes
3 3 answers
450
450 views
GO Classes asked Sep 13, 2025
450 views
GO Classes DPP | Algorithm |Dijkstra’s algo
Consider the following weighted, directed graph. If Dijkstra's single-source shortest path algorithm is run with source vertex 'S', what is the order in which the vertice...
2 2 votes
2 2 answers
388
388 views
GO Classes asked Sep 13, 2025
388 views
GO Classes DPP | Algorithm |Minimum spanning tree
Consider a connected, undirected graph $G=(V, E)$ with a weight function $w: E \rightarrow \mathbb{R}^{+}$ where all edge weights are distinct. Let $T$ be the Minimum Spa...
3 3 votes
3 3 answers
470
470 views
GO Classes asked Sep 13, 2025
470 views
GO Classes DPP | Algorithm |Recurrence relation
Consider the following recurrence:$$\begin{aligned}& T(n)=2 T(\sqrt{n})+1 \\& T(1)=1\end{aligned}$$Which of the following is NOT true?$T(n)=O(\log \log n)$ $T(n)=O(\log n...
3 3 votes
2 2 answers
361
361 views
GO Classes asked Sep 13, 2025
361 views
GO Classes DPP | Algorithm |ISRO
The recurrence relation that arises in relation with the complexity of binary search is$T(n)=2 T(n / 2)+k$, where k is constant $T(n)=T(n / 2)+k$, where k is constant $T(...