試題詳解

6. Huffman coding is an efficient method of compressing data without losing information. Symbols that appear more often will be encoded as a shorter bit string, while symbols that are not used much will be encoded with longer strings. If Huffman coding is used to compress a sequence with 5 different codewords, which of the following probability distributions will lead to the WORST compression ratio?
(A) 0.2, 0.2, 0.2, 0.2, 0.2
(B) 0.02, 0.02, 0.03, 0.03, 0.9
(C) 0.1, 0.1, 0.2, 0.3, 0.3
(D) 0.1, 0.2, 0.2, 0.2, 0.3
(E) 0.05, 0.05, 0.2, 0.2, 0.5