engineering recuitment GATE CSE 2023-24 Test Series Algorithms Algorithm Design Techniques Greedy Algorithms
Consider an optimal Huffman code for the following set of frequencies, based on the Fibonacci numbers, that is, a:1 b:1 c:2 d:3 ……. and so on. What will be the maximum number of bits required for the first 9 characters?
Enter numerical value using the virtual keypad. Round off where necessary.