ThatQuiz Test Library Take this test now
Huffman Coding - Quiz
Contributed by: Singh
  • 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) Fixed-length encoding
C) Variable-length encoding
D) Binary encoding
  • 3. In Huffman Coding, what type of symbols have shorter codes?
A) Symbols at odd indices
B) Rare symbols
C) Symbols starting with A
D) Frequent symbols
  • 4. What is a prefix code in Huffman Coding?
A) A code where no codeword is a prefix of another
B) A code that starts with the same symbol
C) A code with equal-length codewords
D) A code that uses only 0s and 1s
  • 5. What is a Huffman tree also known as?
A) Perfect tree
B) Complete tree
C) Optimal binary tree
D) Balanced tree
  • 6. How is the efficiency of Huffman Coding usually measured?
A) Memory consumption
B) Encoding speed
C) Compression ratio
D) Number of symbols
  • 7. What's the worst-case time complexity of building a Huffman tree?
A) O(log n)
B) O(n)
C) O(n2)
D) O(n log n)
  • 8. Which step comes after building the Huffman tree in the encoding process?
A) Compressing the data
B) Calculating symbol frequencies
C) Building a linked list
D) Assigning binary codes to symbols
  • 9. In Huffman Coding, what symbol is typically assigned the shortest code?
A) Least frequent symbol
B) Symbol with a prime number
C) Symbol with the longest name
D) Most frequent symbol
  • 10. Which data structure is commonly used to implement a priority queue in Huffman Coding?
A) Stack
B) Binary heap
C) Linked list
D) Queue
  • 11. What kind of codes does Huffman Coding produce?
A) Suffix codes
B) Prefix codes
C) Postfix codes
D) Infix codes
  • 12. In which year was the paper 'A Method for the Construction of Minimum-Redundancy Codes' published?
A) 1952
B) 1960
C) 1955
D) 1949
  • 13. Which data structure is used for efficient insertion and retrieval of nodes by probability in a simple Huffman tree construction algorithm?
A) Priority queue
B) Stack
C) Queue
D) Array
  • 14. What is a common use of modified Huffman coding?
A) Text compression in word processors.
B) Image encoding for web pages.
C) Audio file compression.
D) Fax machines.
  • 15. Which university was David A. Huffman attending when he developed the algorithm?
A) MIT
B) Stanford University
C) Harvard University
D) Princeton University
  • 16. What happens to the two nodes with the smallest probability during Huffman tree construction?
A) They remain as leaf nodes
B) They are combined into a new internal node
C) They become root nodes
D) They are removed from the tree
  • 17. In the linear-time Huffman tree construction, where are initial weights enqueued?
A) The first queue
B) Neither queue
C) The second queue
D) Both queues simultaneously
  • 18. What is the formula for entropy H(A)?
A) H(A) = ∑(w_i > 0) h(a_i) / w_i
B) H(A) = ∑(w_i > 0) log2(w_i)
C) H(A) = -∑(w_i > 0) w_i * log2(w_i)
D) H(A) = ∑(w_i > 0) w_i / log2(w_i)
  • 19. How do you break ties between queues to minimize variance in Huffman coding?
A) Remove both items and start over
B) Choose the item in the first queue
C) Choose the item in the second queue
D) Randomly select an item from either queue
  • 20. How is the information content h(a_i) of a symbol ai defined?
A) h(a_i) = log2(1 / w_i)
B) h(a_i) = -log2(w_i)
C) h(a_i) = w_i * log2(w_i)
D) h(a_i) = 2w_i
  • 21. What kind of problems can Huffman template algorithms solve?
A) Problems that do not involve weights.
B) Only compression-related problems.
C) Minimizing the maximum weighted path length, among others.
D) Problems related to sorting data.
  • 22. Which method can replace Huffman coding if a better compression ratio is required?
A) Arithmetic coding
B) Run-length encoding
C) Shannon-Fano coding
D) Lempel-Ziv-Welch (LZW)
  • 23. What does bit '0' represent in a Huffman tree?
A) Following the right child
B) A leaf node
C) Following the left child
D) An internal node
  • 24. Who solved the Huffman coding problem with unequal letter costs?
A) Alan Turing.
B) Richard M. Karp.
C) Adriano Garsia.
D) T. C. Hu.
  • 25. What is required when using Huffman coding with unknown input probabilities?
A) An encryption key must accompany the compressed data.
B) No additional information needs to be stored.
C) A frequency table must be stored with the compressed text.
D) The original text must be stored alongside the compressed version.
  • 26. When constructing a Huffman tree using two queues, how do you ensure the lowest weight is always at the front?
A) By sorting both queues by weight after each insertion
B) By randomly selecting nodes from either queue
C) By only enqueuing nodes with unique weights
D) By keeping initial weights in the first queue and combined weights in the second queue
  • 27. What algorithm solves the problem of length-limited Huffman coding?
A) Binary Huffman algorithm.
B) Template Huffman algorithm.
C) Adaptive Huffman algorithm.
D) The package-merge algorithm.
  • 28. What is the contribution of a symbol with zero probability to entropy?
A) It equals the inverse of its weight
B) Zero, since lim_(w→0+) w * log2(w) = 0
C) It is equal to the symbol's information content
D) It contributes negatively to the entropy
  • 29. How many queues are used in the linear-time method to create a Huffman tree?
A) One
B) Four
C) Three
D) Two
  • 30. In alphabetic Huffman coding, what must be identical between inputs and outputs?
A) The binary representation.
B) The alphabetic order.
C) The frequency of occurrence.
D) The transmission cost.
Created with That Quiz — the math test generation site with resources for other subject areas.