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