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