ThatQuiz
|
Test Library
|
Take this test now
Huffman Coding
  • 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) Variable-length encoding
B) ASCII encoding
C) Binary encoding
D) Fixed-length encoding
  • 3. In Huffman Coding, what type of symbols have shorter codes?
A) Rare symbols
B) Symbols at odd indices
C) Symbols starting with A
D) Frequent symbols
  • 4. What is a prefix code in Huffman Coding?
A) A code where no codeword is a prefix of another
B) A code that starts with the same symbol
C) A code with equal-length codewords
D) A code that uses only 0s and 1s
  • 5. What is a Huffman tree also known as?
A) Optimal binary tree
B) Balanced tree
C) Perfect tree
D) Complete tree
  • 6. How is the efficiency of Huffman Coding usually measured?
A) Compression ratio
B) Number of symbols
C) Encoding speed
D) Memory consumption
  • 7. What's the worst-case time complexity of building a Huffman tree?
A) O(n)
B) O(n log n)
C) O(log n)
D) O(n2)
  • 8. Which step comes after building the Huffman tree in the encoding process?
A) Calculating symbol frequencies
B) Assigning binary codes to symbols
C) Building a linked list
D) Compressing the data
  • 9. In Huffman Coding, what symbol is typically assigned the shortest code?
A) Most frequent symbol
B) Symbol with a prime number
C) Least frequent symbol
D) Symbol with the longest name
  • 10. Which data structure is commonly used to implement a priority queue in Huffman Coding?
A) Linked list
B) Stack
C) Binary heap
D) Queue
  • 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) 1949
C) 1952
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) Array
B) Queue
C) Stack
D) Priority queue
  • 14. What is a common use of modified Huffman coding?
A) Image encoding for web pages.
B) Audio file compression.
C) Fax machines.
D) Text compression in word processors.
  • 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 removed from the tree
B) They are combined into a new internal node
C) They remain as leaf nodes
D) They become root 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) log2(w_i)
C) H(A) = ∑(w_i > 0) w_i / 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 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) = 2w_i
B) h(a_i) = w_i * log2(w_i)
C) h(a_i) = log2(1 / w_i)
D) h(a_i) = -log2(w_i)
  • 21. What kind of problems can Huffman template algorithms solve?
A) Minimizing the maximum weighted path length, among others.
B) Only compression-related problems.
C) Problems that do not involve weights.
D) Problems related to sorting data.
  • 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) An internal node
B) Following the left child
C) Following the right child
D) A leaf node
  • 24. Who solved the Huffman coding problem with unequal letter costs?
A) Adriano Garsia.
B) Alan Turing.
C) T. C. Hu.
D) Richard M. Karp.
  • 25. What is required when using Huffman coding with unknown input probabilities?
A) An encryption key must accompany the compressed data.
B) No additional information needs to be stored.
C) A frequency table must be stored with the compressed text.
D) The original text must be stored alongside the compressed version.
  • 26. When constructing a Huffman tree using two queues, how do you ensure the lowest weight is always at the front?
A) By sorting both queues by weight after each insertion
B) By keeping initial weights in the first queue and combined weights in the second queue
C) By randomly selecting nodes from either queue
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) Adaptive Huffman algorithm.
C) Binary Huffman algorithm.
D) Template Huffman algorithm.
  • 28. What is the contribution of a symbol with zero probability to entropy?
A) It equals the inverse of its weight
B) It is equal to the symbol's information content
C) It contributes negatively to the entropy
D) Zero, since lim_(w→0+) w * log2(w) = 0
  • 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 alphabetic order.
C) The binary representation.
D) The frequency of occurrence.
Created with That Quiz — the math test generation site with resources for other subject areas.