ThatQuiz
|
Test Library
|
Take this test now
Huffman Coding - Quiz
  • 1. Who introduced Huffman Coding?
A) David A. Huffman
B) Robert Johnson
C) Alice Jones
D) John Smith
  • 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 at odd indices
C) Symbols starting with A
D) Rare symbols
  • 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) Complete tree
C) Balanced tree
D) Perfect tree
  • 6. How is the efficiency of Huffman Coding usually measured?
A) Compression ratio
B) Memory consumption
C) Encoding speed
D) Number of symbols
  • 7. What's the worst-case time complexity of building a Huffman tree?
A) O(n2)
B) O(n)
C) O(n log n)
D) O(log n)
  • 8. Which step comes after building the Huffman tree in the encoding process?
A) Assigning binary codes to symbols
B) Calculating symbol frequencies
C) Compressing the data
D) Building a linked list
  • 9. In Huffman Coding, what symbol is typically assigned the shortest code?
A) Symbol with the longest name
B) Symbol with a prime number
C) Most frequent symbol
D) Least frequent symbol
  • 10. Which data structure is commonly used to implement a priority queue in Huffman Coding?
A) Linked list
B) Queue
C) Binary heap
D) Stack
  • 11. What kind of codes does Huffman Coding produce?
A) Prefix codes
B) Infix codes
C) Suffix codes
D) Postfix codes
  • 12. In which year was the paper 'A Method for the Construction of Minimum-Redundancy Codes' published?
A) 1955
B) 1952
C) 1960
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) Array
B) Queue
C) Priority queue
D) Stack
  • 14. What is a common use of modified Huffman coding?
A) Image encoding for web pages.
B) Audio file compression.
C) Text compression in word processors.
D) Fax machines.
  • 15. Which university was David A. Huffman attending when he developed the algorithm?
A) Harvard University
B) Stanford University
C) MIT
D) Princeton University
  • 16. What happens to the two nodes with the smallest probability during Huffman tree construction?
A) They are removed from the tree
B) They become root nodes
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) Both queues simultaneously
B) Neither queue
C) The first 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) Randomly select an item from either queue
C) Choose the item in the first queue
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(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) Only compression-related problems.
B) Problems that do not involve weights.
C) Problems related to sorting data.
D) Minimizing the maximum weighted path length, among others.
  • 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) An internal node
B) A leaf node
C) Following the right child
D) Following the left child
  • 24. Who solved the Huffman coding problem with unequal letter costs?
A) Richard M. Karp.
B) Alan Turing.
C) Adriano Garsia.
D) T. C. Hu.
  • 25. What is required when using Huffman coding with unknown input probabilities?
A) A frequency table must be stored with the compressed text.
B) An encryption key must accompany the compressed data.
C) The original text must be stored alongside the compressed version.
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 keeping initial weights in the first queue and combined weights in the second queue
B) By randomly selecting nodes from either 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) Binary Huffman algorithm.
C) Adaptive Huffman algorithm.
D) Template Huffman 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) Zero, since lim_(w→0+) w * log2(w) = 0
C) It contributes negatively to the entropy
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) 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.