курсера 102-152

Which of the following symbols will get the shortest codeword after Shannon-Fano coding if probabilities are p(a) = 0.05, p(b) = 0.6, p(c) = 0.2 and p(d) = 0.15?

• c

• a

• d

• b

Which of the following codes is uniform?

• 10,011,11,001,010

• 0,10,110,1110,1111

• 10,01,0001,100,1010

• 100,110,001,000,010

Which of the following codes is uniform?

• Shannon-Fano

• ASCII

• Huffman

• None of the given

Which of the following codes is prefix?

• 0, 01, 11

• 0, 10, 1

• 0, 01, 001

• 0, 10, 11

Which of the following codes is prefix?

• 0, 111, 11

• 0, 111, 10

• 0, 101, 10

• 00, 10, 101

Which of the following codes has the highest redundancy?

• redundancy is constant for all of the Hamming codes

• Hamming (7,4)

• Hamming (15,11)

• Hamming (31,26)

Which of the following codes has the highest code rate?

• code rate is constant for all of the Hamming codes

• Hamming (31,26)

• Hamming (15,11)

• Hamming (7,4)

Which of the following codes can be the Huffman code for the letters a,b,c,d,e?

• 10,011,11,001,010

• 0,10,110,1110,1111

• 10,01,0001,100,1010

• 100,110,001,000,010

Which letter will get the shortest codeword after Huffman coding of the word "abracadabra"?

• c

• r

• d

• a

When the base of the logarithm is e, then the unit of measure of information is

• bytes

• nits

• dits

• bits