engineering recuitment GATE CSE 2023-24 Test Series Algorithms Algorithm Design Techniques Greedy Algorithms
Consider the problem of Huffman coding for messages (M1 – M7) with relative frequencies of (q1 – q7) = (4,5,7,8,10,12,20).
The binary code of the message M5 is
1
101
2
11
3
00
4
1001