ThatQuiz
|
Test Library
|
Take this test now
Huffman Coding
  • 1. Who introduced Huffman Coding?
A) Alice Jones
B) John Smith
C) David A. Huffman
D) Robert Johnson
  • 2. Which type of encoding does Huffman Coding use?
A) ASCII encoding
B) Binary encoding
C) Variable-length encoding
D) Fixed-length encoding
  • 3. In Huffman Coding, what type of symbols have shorter codes?
A) Symbols starting with A
B) Frequent symbols
C) Rare symbols
D) Symbols at odd indices
  • 4. What is a prefix code in Huffman Coding?
A) A code that uses only 0s and 1s
B) A code where no codeword is a prefix of another
C) A code with equal-length codewords
D) A code that starts with the same symbol
  • 5. What is a Huffman tree also known as?
A) Balanced tree
B) Optimal binary tree
C) Perfect tree
D) Complete tree
  • 6. How is the efficiency of Huffman Coding usually measured?
A) Number of symbols
B) Encoding speed
C) Compression ratio
D) Memory consumption
  • 7. What's the worst-case time complexity of building a Huffman tree?
A) O(log n)
B) O(n)
C) O(n log n)
D) O(n2)
  • 8. Which step comes after building the Huffman tree in the encoding process?
A) Calculating symbol frequencies
B) Compressing the data
C) Assigning binary codes to symbols
D) Building a linked list
  • 9. In Huffman Coding, what symbol is typically assigned the shortest code?
A) Most frequent symbol
B) Least frequent symbol
C) Symbol with the longest name
D) Symbol with a prime number
  • 10. Which data structure is commonly used to implement a priority queue in Huffman Coding?
A) Stack
B) Binary heap
C) Queue
D) Linked list
  • 11. What kind of codes does Huffman Coding produce?
A) Suffix codes
B) Infix codes
C) Postfix codes
D) Prefix codes
Created with That Quiz — the math test generation site with resources for other subject areas.