Huffman Code Multiple choice Questions and Answers (MCQs)

YOU CAN DOWNLOAD 200+ SUBJECTS PDF BOOK FOR COMPETITIVE EXAMINATIONS

CLICK HERE TO DOWNLOAD

Huffman Code Multiple choice Questions and Answers (MCQs)

Question 11 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
The type of encoding where no character code is the prefix of another character code is called?
A
optimal encoding
B
prefix encoding
C
frequency encoding
D
trie encoding
Question 11 Explanation: 
Even if the character codes are of different lengths, the encoding where no character code is the prefix of another character code is called prefix encoding.

Question 12 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
What is the running time of the Huffman encoding algorithm?
A
O(C)
B
O(log C)
C
O(C log C)
D
O( N log C)
Question 12 Explanation: 
If we maintain the trees in a priority queue, ordered by weight, then the running time is given by O(C log C).

Question 13 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
What is the running time of the Huffman algorithm, if its implementation of the priority queue is done using linked lists?
A
O(C)
B
O(log C)
C
O(C log C)
D
O(C2)
Question 13 Explanation: 
If the implementation of the priority queue is done using linked lists, the running time of Huffman algorithm is O(C2).

There are 13 questions to complete.