ТЭЦ вопросы2

81. How does a noise affect the data?

• A) change only the 0 to 1

• B) change only the 1 to 0

• C) change the 0 to 1 and the 1 to 0

• D) None of the above

82. How many data bits are in the (15, 11) Hamming code?

• 11

• 4

• 15

• 5

83. How many data bits are in the (31, 26) Hamming code?

• 26

• 31

• 5

• 4

84. How many data bits are in the (7, 4) Hamming code?

• 4

• 3

• 7

• 10

85. How many parity bits are in the (15, 11) Hamming code?

• 4

• 15

• 11

• 5

86. How many parity bits are in the (31, 26) Hamming code?

• 26

• 31

• 5

• 4

87. How many parity bits are in the (7, 4) Hamming code?

• 3

• 4

• 7

• 11

88. A Huffman code is a = 0, b = 10, c = 110, d = 1110, e = 1111. Probabilities are p(a) = 0.50, p(b) = 0.30, p(c) = 0.15, p(d) = 0.03, p(e) = 0.02. The average length of a code words is

• A) 1.75 bit

• B) 2.0 bit

• C) 1.3 bit

• D) 1.7 bit

89. Which letter will get the shortest codeword after Huffman coding of the word «bbaacccabaac»?

• a

• b

• c

• none

90. An alphabet consist of the letters a, b, c, d, e and f. The probability of occurrence is p(a) = 0.06, p(b) = 0.15, p(c) = 0.4 and p(d) = 0.18, p(e)=0.17, p(f)=0.04. The Huffman code is

• A) c=1,d=000,e=001,b=010,a=0110,f=0111

• B) c=0,d=111,e=110,b=101,a=1001,f=1000

• C) c=1,d=01,e=001,b=0000,a=00010,f=00011

• D) c=1,d=01,e=001,b=000,a=0010,f=00011

• E) c=0,d=101,e=110,b=101,a=1000,f=1001