# Huffman Code Multiple choice Questions and Answers (MCQs)

## Huffman Code Multiple choice Questions and Answers (MCQs)

 Question 1 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Which of the following algorithms is the best approach for solving Huffman codes?
 A exhaustive search B greedy algorithm C brute force algorithm D divide and conquer algorithm
Question 1 Explanation:
Greedy algorithm is the best approach for solving the Huffman codes problem since it greedily searches for an optimal solution.

 Question 2 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
How many printable characters does the ASCII character set consists of?
 A 120 B 128 C 100 D 98
Question 2 Explanation:
Out of 128 characters in an ASCII set, roughly, only 100 characters are printable while the rest are non-printable.

 Question 3 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Which bit is reserved as a parity bit in an ASCII set?
 A first B seventh C eighth D tenth
Question 3 Explanation:
In an ASCII character set, seven bits are reserved for character representation while the eighth bit is a parity bit.

 Question 4 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
How many bits are needed for standard encoding if the size of the character set is X?
 A log X B X+1 C 2X D X2
Question 4 Explanation:
If the size of the character set is, x then [log X] bits are needed for representation in a standard encoding.

 Question 5 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
The code length does not depend on the frequency of occurrence of characters.
 A true B false
Question 5 Explanation:
The code length depends on the frequency of occurrence of characters. The more frequent the character occurs, the less is the length of the code.

There are 5 questions to complete.