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