Teaching HPSC Lecturer (Technical) Mock Test 2024 Algorithms Algorithm Design Techniques Greedy Algorithms
Suppose that we construct a Huffman code to encode all of the characters in a file with a minimum number of bits. What is the last digit of the number of bits that would be required to encode a file containing just the string “EEEABBCCDDEEE” ? (Compute the total no of bits to encode all of the characters in the file)
1
0 or 5
2
1 or 6
3
2 or 7
4
3 or 8
5
Question Not Attempted