Huffman Coding

1. Who introduced Huffman Coding?

A) John Smith
B) Robert Johnson
C) David A. Huffman
D) Alice Jones

2. Which type of encoding does Huffman Coding use?

A) Fixed-length encoding
B) Variable-length encoding
C) ASCII encoding
D) Binary encoding

3. In Huffman Coding, what type of symbols have shorter codes?

A) Symbols starting with A
B) Symbols at odd indices
C) Frequent symbols
D) Rare symbols

4. What is a prefix code in Huffman Coding?

A) A code where no codeword is a prefix of another
B) A code with equal-length codewords
C) A code that uses only 0s and 1s
D) A code that starts with the same symbol

5. What's the worst-case time complexity of building a Huffman tree?

A) O(log n)
B) O(n log n)
C) O(n)
D) O(n²)

6. Which data structure is commonly used to implement a priority queue in Huffman Coding?

A) Linked list
B) Stack
C) Binary heap
D) Queue

7. In Huffman Coding, what symbol is typically assigned the shortest code?

A) Symbol with the longest name
B) Least frequent symbol
C) Symbol with a prime number
D) Most frequent symbol

8. What is a Huffman tree also known as?

A) Balanced tree
B) Complete tree
C) Perfect tree
D) Optimal binary tree

9. Which step comes after building the Huffman tree in the encoding process?

A) Assigning binary codes to symbols
B) Compressing the data
C) Building a linked list
D) Calculating symbol frequencies

10. What kind of codes does Huffman Coding produce?

A) Postfix codes
B) Infix codes
C) Prefix codes
D) Suffix codes

11. How is the efficiency of Huffman Coding usually measured?

A) Encoding speed
B) Memory consumption
C) Compression ratio
D) Number of symbols

Created with That Quiz — the math test generation site with resources for other subject areas.