ThatQuiz
|
Test Library
|
Take this test now
Huffman Coding
  • 1. Who introduced Huffman Coding?
A) David A. Huffman
B) Alice Jones
C) Robert Johnson
D) John Smith
  • 2. Which type of encoding does Huffman Coding use?
A) Fixed-length encoding
B) Variable-length encoding
C) Binary encoding
D) ASCII encoding
  • 3. In Huffman Coding, what type of symbols have shorter codes?
A) Rare symbols
B) Symbols at odd indices
C) Frequent symbols
D) Symbols starting with A
  • 4. What is a prefix code in Huffman Coding?
A) A code where no codeword is a prefix of another
B) A code with equal-length codewords
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) Number of symbols
B) Compression ratio
C) Encoding speed
D) Memory consumption
  • 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) Assigning binary codes to symbols
C) Calculating symbol frequencies
D) Building a linked list
  • 9. In Huffman Coding, what symbol is typically assigned the shortest code?
A) Symbol with the longest name
B) Most frequent symbol
C) Symbol with a prime number
D) Least frequent symbol
  • 10. Which data structure is commonly used to implement a priority queue in Huffman Coding?
A) Queue
B) Binary heap
C) Linked list
D) Stack
  • 11. What kind of codes does Huffman Coding produce?
A) Postfix codes
B) Infix codes
C) Prefix codes
D) Suffix codes
  • 12. In which year was the paper 'A Method for the Construction of Minimum-Redundancy Codes' published?
A) 1952
B) 1960
C) 1955
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) Priority queue
C) Queue
D) Stack
  • 14. What is a common use of modified Huffman coding?
A) Audio file compression.
B) Fax machines.
C) Text compression in word processors.
D) Image encoding for web pages.
  • 15. Which university was David A. Huffman attending when he developed the algorithm?
A) MIT
B) Harvard University
C) Stanford University
D) Princeton 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) Both queues simultaneously
B) The first queue
C) The second queue
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) w_i / log2(w_i)
C) H(A) = ∑(w_i > 0) h(a_i) / 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) = w_i * log2(w_i)
B) h(a_i) = log2(1 / w_i)
C) h(a_i) = 2w_i
D) h(a_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) Minimizing the maximum weighted path length, among others.
D) Problems that do not involve weights.
  • 22. Which method can replace Huffman coding if a better compression ratio is required?
A) Shannon-Fano coding
B) Lempel-Ziv-Welch (LZW)
C) Arithmetic coding
D) Run-length encoding
  • 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) T. C. Hu.
B) Alan Turing.
C) Adriano Garsia.
D) Richard M. Karp.
  • 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) An encryption key must accompany the compressed data.
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) 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) It contributes negatively to the entropy
B) Zero, since lim_(w→0+) w * log2(w) = 0
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 transmission cost.
B) The alphabetic order.
C) The frequency of occurrence.
D) The binary representation.
Created with That Quiz — the math test generation site with resources for other subject areas.