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