wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

Final Theory Information(2024)

Total questions: 152

Worksheet time: 1hrs 16mins

Name
Class
Date
1.

______ indicate(s) an error in a received combination.

a)

Parity bits

b)

Error syndrome

c)

Data bits

d)

None of the given

2.

... is a measure of uncertainty

a)

Entropy

b)

Encoding

c)

Information

d)

Redundancy

3.

A code has two allowable combinations 101 and 010. What is the allowable combination for the error combination 001?

a)

010

b)

100

c)

101

d)

None

4.

A code has two allowable combinations 101 and 010. What is the allowable combination for the error combination 100?

a)

101

b)

010

c)

100

d)

None

5.

A code has two allowable combinations 101 and 010. What is the allowable combination for the error combination 000?

a)

100

b)

010

c)

101

d)

None

6.

A code has two allowable combinations 101 and 010. What is the allowable combination for the error combination 111?

a)

111

b)

101

c)

010

d)

None

7.

A code has two allowable combinations 101 and 010. What is the allowable combination for the error combination 011?

a)

111

b)

101

c)

010

d)

None

8.

A code has two allowable combinations 101 and 010. What is the allowable combination for the error combination 110?

a)

110

b)

010

c)

101

d)

None

9.

A codeword of the Hamming code consists of ________ and ________ bits.

a)

data; parity

b)

allowable; not allowable

c)

with errors; without errors

d)

none of the given

10.

A Huffman code is a = 1, b = 000, c = 001, d = 01. Probabilities are p(a) = 0.4, p(b) = 0.1, p(c) = 0.2, p(d) = 0.3. The average length of codewords q is

a)

2.1 bit

b)

1.9 bit

c)

2.0 bit

d)

8.0 bit

11.

A redundancy of a code S = ...

a)

1 - Iavr/Imax

b)

Iavr/Imax

c)

1 + Iavr/Imax

d)

Imax/Iavr

12.

An average length of codewords qavr = ...

a)

∑ (pi/qi)

b)

∑pi / n

c)

∑ (pi*qi)

d)

∑qi / n

13.

An efficiency of a code E = ...

a)

Imax/Iavr

b)

Iavr/100

c)

Iavr/Imax

d)

Imax - Iavr

14.

ASCII code is a

a)

Variable length code

b)

Fixed length code

c)

Error-correction code

d)

None of the given

15.

By the Bayes' rule for conditional entropy H(Y|X) = ...

a)

[P(A)] /P(B)

b)

H(X|Y) - H(X) + H(Y)

c)

H(X|Y) - H(X)

d)

H(X|Y)+ H(Y)

16.

By the Bayes' theorem ...

a)

P(A|B) = [P(B|A)][P(A)] /P(B)

b)

P(B|A) = P(A and B)/P(A)

c)

P(B|A) = P(A and B)*P(A)

d)

P(A|B) = [P(B|A)][P(A)] * P(B)

17.

By the Chain rule H(X,Y) = H(Y|X) + ...

a)

H(X)

b)

H(Y)

c)

H(Y|X)

d)

 H(X|Y)

18.

By the Hartley's formula the amount of information I = ...

a)

I = m*n

b)

I = log (m/n)

c)

I = n*log m

d)

I = log (m*n)

19.

By the Hartley's formula the entropy H = ...

a)

H = - ∑(pi*log pi)

b)

H = - ∑ (log pi)

c)

H = log m

d)

H = - ∑ (pi/log pi)

20.

By the property of joint entropy H(X,Y) <= ...

a)

H(X)

b)

H(Y)

c)

H(X) + H(Y)

d)

None of the given

21.

By the property of joint entropy H(X,Y) ...

a)

H(X,Y) >= H(X) and H(X,Y) <= H(Y)

b)

H(X,Y) <= H(X) and H(X,Y) >= H(Y)

c)

H(X,Y) >= H(X) and H(X,Y) >= H(Y)

d)

H(X,Y) >= H(X) + H(Y)

22.

By the Shannon's formula the amount of information I = ...

a)

H = - n *∑(pi*log pi)

b)

H = - n * ∑ (log pi)

c)

H = - n * ∑ pi

d)

H = - n * ∑ (pi/log pi)

23.

By the Shannon's formula the entropy H = ...

a)

H = - ∑(pi*log pi)

b)

H = - ∑ (log pi)

c)

H = - ∑ pi

d)

H = - ∑ (pi/log pi)

24.

Calculate the code rate for Hamming (15,11) code

a)

1

b)

0,733

c)

0,571

d)

0,839

25.

Calculate the code rate for Hamming (31,26) code

a)

1

b)

0,733

c)

0,839

d)

0,571

26.

Calculate the code rate for Hamming (7,4) code

a)

1

b)

0,571

c)

0,733

d)

0,839

27.

  1. 70. Encode a string "1100" with Hamming (7,4) code using thefollowing structure (i1, i2, i3, i4, r1, r2, r3)

a)

A)1100110

b)

B) 1100000

c)

C) 1100010

d)

D) 1100011

28.

  1. 71. Encode a string "1101" with Hamming (7,4) code using thefollowing structure (i1, i2, i3, i4, r1, r2, r3)

a)

A) 1101101

b)

B) 1101011

c)

C) 1101001

d)

D) 1101000

29.

72. Encode a string "1110" with Hamming (7,4) code using thefollowing structure (i1, i2, i3, i4, r1, r2, r3)

a)

A) 1110000

b)

B) 1110101

c)

C) 1110100

d)

D) 1110110

30.

73. Encode a string "1111" with Hamming (7,4) code using thefollowing structure (i1, i2, i3, i4, r1, r2, r3)

a)

A) 1111110

b)

B) 1111011

c)

C) 1111111

d)

D) 1111101

31.

74. The length of the message is 16 symbols and the message’salphabet consists of 4 symbols. Find the amount of informationin this message.

a)

A) 16

b)

B) 80

c)

C) 64

d)

D) 32

32.

75. The efficiency of the language is 0,5 and its I average isequal to 1 bit. Calculate the number of letters in this language’salphabet?

a)

A) 64

b)

B) 32

c)

C) 4

d)

D) 16

33.

76. Elements of alphabets X and Y are statistically related. It isknown that H(X)=4 bits and H(Y)=10 bits. What are a range ofvariation for a conditional entropy H(Y|X) when H(X|Y) changes from its min to max?

a)

A) (from 7 to 11)

b)

B) (from 4 to 12)

c)

C) (from 6 to 10)

d)

D) (from 6 to 11)

34.

77. For Hamming distance dmin and r errors in the receivedword, the condition to be able to detect the errors is

a)

A) dmin>= r+1

b)

B) dmin>= 2r+1

c)

C) dmin>= 2r+2

d)

D) dmin>= r+2

35.

78. For Hamming distance dmin and s errors in the receivedword, the condition to be able to correct the errors is

a)

A) dmin>= s+1

b)

B) dmin>= 2s+1

c)

C) dmin>= 2s+2

d)

D) dmin>= s+2

36.

79. Hamming (7,4) code can correct ___ error(s)

a)

A) 2

b)

B) 3

c)

C) 1

d)

D) 0

37.

80. Hamming distance can easily be found with ...

a)

A) XNOR operation

b)

B) XOR operation

c)

C) OR operation

d)

D) AND operation

38.

81. How does a noise affect the data?

a)

A) change only the 0 to 1

b)

B) change only the 1 to 0

c)

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

d)

D) None of the above

39.

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

a)

A) 11

b)

B) 4

c)

C) 15

d)

D) 5

40.

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

a)

A) 26

b)

B) 31

c)

C) 5

d)

D) 4

41.

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

a)

A) 4

b)

B) 3

c)

C) 7

d)

D) 10

42.

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

a)

A) 4

b)

B) 15

c)

C) 11

d)

D) 5

43.

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

a)

A) 26

b)

B) 31

c)

C) 5

d)

D) 4

44.

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

a)

A) 3

b)

B) 4

c)

C) 7

d)

D) 11

45.

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)

A) 1.75 bit

b)

B) 2.0 bit

c)

C) 1.3 bit

d)

D) 1.7 bit

46.

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

a)

A) a

b)

B) b

c)

C) c

d)

D) none

47.

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)

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

b)

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

c)

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

d)

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

e)

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

48.

91. If k - number of bits before Hamming encoding and n - number of bits after Hamming encoding then

a)

A) k > n

b)

B) k < n

c)

C) k = n

d)

D) k = 1/2 n

49.

Calculate the efficiency of the language if it has 32 letters and its I average is 1 bit.

a)

0.8

b)

0.2

c)

5

d)

11

50.

28. Calculate the redundancy of the language if it has 32 letters and its I average is 1 bit.

a)

0.8

b)

0.2

c)

5

d)

1

51.

29. Choose an example of block code

a)

Shannon-Fano code

b)

Huffman code

c)

Hamming code

d)

None of the given

52.

30. Choose conditions of an optimal coding (p – probability, l – length of a code word)

a)

A) pi < pj and li<=lj

b)

B) pi > pj and li<=lj

c)

C) pi > pj and li>=lj

d)

D) none of the given

53.

31. Choose the formula to create the Hamming code

a)

A) (n, k) = (2r - 1, 2r - 1 - r)

b)

B) (n, k) = (2r, 2r - 1 - r)

c)

C) (n, k) = (2r - 1, 2r - r)

d)

D) (n, k) = (2r - 1, 2r - 1 + r)

54.

Choose the formula to determine the number N of possible messages with length n if the message source alphabet consists of m characters, each of which can be an element of the message.

a)

A) N = mn

b)

N = m^n

c)

C) N = m*n

d)

D) N = log m

55.

33. Code has dmin = 1. How many errors can be corrected by this code?

a)

2

b)

3

c)

0

d)

1

56.

34. Code has dmin = 1. How many errors can be detected by this code?

a)

2

b)

3

c)

0

d)

1

57.

35. Code has dmin = 10. How many errors can be detected by this code?

a)

4

b)

8

c)

9

d)

10

58.

37. Code has dmin = 11. How many errors can be detected by this code?

a)

A) 5

b)

B) 9

c)

C) 10

d)

D) 11

59.

36. Code has dmin = 11. How many errors can be corrected by this code?

a)

A) 11

b)

B) 7

c)

C) 5

d)

D) 10

60.

39. Code has dmin = 2. How many errors can be corrected by this code?

a)

2

b)

3

c)

1

d)

0

61.

38. Code has dmin = 12. How many errors can be detected by this code?

a)

11

b)

5

c)

10

d)

12

62.

40. Code has dmin = 2. How many errors can be detected by this code?

a)

2

b)

3

c)

1

d)

0

63.

41. Code has dmin = 3. How many errors can be corrected by this code?

a)

2

b)

3

c)

1

d)

4

64.

43. Code has dmin = 4. How many errors can be detected by this code?

a)

3

b)

5

c)

1

d)

4

65.

42. Code has dmin = 3. How many errors can be detected by this code?

a)

1

b)

3

c)

2

d)

4

66.

44. Code has dmin = 5. How many errors can be corrected by this code?

a)

5

b)

3

c)

2

d)

4

67.

45. Code has dmin = 5. How many errors can be detected by this code?

a)

6

b)

2

c)

4

d)

5

68.

46. Code has dmin = 6. How many errors can be detected by this code?

a)

6

b)

2

c)

5

d)

4

69.

47. Code has dmin = 7. How many errors can be corrected by this code?

a)

5

b)

6

c)

3

d)

4

70.

48. Code has dmin = 7. How many errors can be detected by this code?

a)

7

b)

3

c)

6

d)

5

71.

  1. 114.The first code combination is 0000 and the Hamming distance of this code equals 4. Choose the second combination. 1

a)

1111

b)

1011

c)

0011

d)

0000

72.

115. The Hamming code is a method of _______. 

a)

B) Optimal coding 

b)

A) Error control coding 

c)

C) None of the above 

73.

116. The Hamming distance between "client" and "server" is 

a)

0

b)

1

c)

6

d)

impossible to detect 

74.

117. The Hamming distance between "make" and "made" is 

a)

4

b)

3

c)

1

d)

D) impossible to detect 

75.

118. The Hamming distance between "push" and "pull" is 

a)

2

b)

4

c)

0

d)

D) impossible to detect 

76.

119. The Hamming distance between "starting" and "finishing" is 

a)

4

b)

3

c)

impossible to detect 

d)

5

77.

120. The Hamming distance between 001111 and 010011 is 

a)

1

b)

2

c)

3

d)

4

78.

121. The Hamming distance between 010111 and 010011 is 

a)

2

b)

3

c)

4

d)

1

79.

122. The Hamming distance between 011111 and 010011 is 

a)

1

b)

2

c)

3

d)

4

80.

123. The Hamming distance between 101001 and 010011 is 

a)

4

b)

2

c)

1

d)

3

81.

124. The length of the message is 16 symbols and the message's alphabet consists of 32 symbols. Find the amount of information in this message. 

a)

80

b)

16

c)

64

d)

32

82.

125. The length of the message is 6 symbols and the message's alphabet consists of 32 symbols. Find the amount of information in this message. 

a)

6

b)

30

c)

32

d)

24

83.

126. The redundancy of the language is 0,75 and its I average is 1 bit. Calculate the number of letters in this language's alphabet? 

a)

16

b)

32

c)

8

d)

64

84.

127. The string was encoded with Hamming (7,4) code using the structure (i1, i2, i3, i4, r1, r2, r3). After a channel the error syndrome is 000. Specify the position of the error. 

a)

i1

b)

r1

c)

no error

d)

r3

85.

128. The string was encoded with Hamming (7,4) code using the structure (i1, i2, i3, i4, r1, r2, r3). After a channel the error syndrome is 001. Specify the position of the error.

a)

r3

b)

r1

c)

i1

d)

no error

86.

129. The string was encoded with Hamming (7,4) code using the structure (i1, i2, i3, i4, r1, r2, r3). After a channel the error syndrome is 010. Specify the position of the error. 

a)

r2

b)

r3

c)

i2

d)

r1

87.

130. The string was encoded with Hamming (7,4) code using the structure (i1, i2, i3, i4, r1, r2, r3). After a channel the error syndrome is 011. Specify the position of the error. 

a)

i4

b)

i1

c)

r4

d)

r1

88.

131. The string was encoded with Hamming (7,4) code using the structure (i1, i2, i3, i4, r1, r2, r3). After a channel the error syndrome is 100. Specify the position of the error. 

a)

i1

b)

r1

c)

r3

d)

r2

89.

132. The string was encoded with Hamming (7,4) code using the structure (i1, i2, i3, i4, r1, r2, r3). After a channel the error syndrome is 101. Specify the position of the error. 

a)

no error

b)

r1

c)

i1

d)

i2

90.

133. The string was encoded with Hamming (7,4) code using the structure (i1, i2, i3, i4, r1, r2, r3). After a channel the error syndrome is 110. Specify the position of the error. 

a)

i3

b)

r3

c)

i4

d)

i1

91.

134. The string was encoded with Hamming (7,4) code using the structure (i1, i2, i3, i4, r1, r2, r3). After a channel the error syndrome is 111. Specify the position of the error. 

A) i4 

a)

i4

b)

r2

c)

i2

d)

no error

92.

135. This is the method for data processing for reducing errors during transmission via channel with noise. 

a)

Error Correction code

b)

Uniform code

c)

Non-uniform code

d)

Optimal code

93.

49. Code has dmin = 8. How many errors can be detected bythis code?

a)

8

b)

6

c)

7

d)

3

94.

50. Code has dmin = 9. How many errors can be corrected bythis code?

a)

5

b)

7

c)

4

d)

8

95.

51. Code has dmin = 9. How many errors can be detected bythis code?7

a)

7

b)

9

c)

8

d)

4

96.

52. Code rate R (k information bits and n total bits) is defined as

a)

k = n/R

b)

R = k * n

c)

R = k/n

d)

n = R * k

97.

53. Conditional entropy H(Y|X) lies between

a)

- H(Y) and 0

b)

0 and H(Y)

c)

- H(Y) and H(Y)

d)

0 and 1

98.

54. Convert the message into a signal suitable for transmissionover the channel of communication, referred to as …

a)

Encoding

b)

Decoding

c)

Entropy

d)

Redundancy

99.

55.Determine the Hamming distance for code that can detect 3 errors and correct 2 errors.

a)

6

b)

5

c)

7

d)

9

100.

56.Determine the Hamming distance for code that can detect 3 errors and correct 1 errors.

a)

5

b)

4

c)

6

d)

8

101.

57. Determine the Hamming distance for code that can detect 5 errors and correct 3 errors.

a)

9

b)

8

c)

10

d)

14

102.

58. Encode a string "0000" with Hamming (7,4) code using thefollowing structure (i1, i2, i3, i4, r1, r2, r3)

a)

0000001

b)

0000111

c)

0000000

d)

0000101

103.

59. Encode a string "0001" with Hamming (7,4) code using thefollowing structure (i1, i2, i3, i4, r1, r2, r3)

a)

0001010

b)

0001001

c)

0001011

d)

0001111

104.

60. Encode a string "0010" with Hamming (7,4) code using thefollowing structure (i1, i2, i3, i4, r1, r2, r3)

a)

0010010

b)

0010111

c)

0010110

d)

0010100

105.

61. Encode a string "0011" with Hamming (7,4) code using thefollowing structure (i1, i2, i3, i4, r1, r2, r3)

a)

0011100

b)

0011001

c)

0011101

d)

0011111

106.

62. Encode a string "0100" with Hamming (7,4) code using thefollowing structure (i1, i2, i3, i4, r1, r2, r3)

a)

0100011

b)

0100110

c)

0100111

d)

0100101

107.

63. Encode a string "0101" with Hamming (7,4) code using thefollowing structure (i1, i2, i3, i4, r1, r2, r3)

a)

0101101

b)

0101000

c)

0101100

d)

0101110

108.

64. Encode a string "0110" with Hamming (7,4) code using thefollowing structure (i1, i2, i3, i4, r1, r2, r3)

a)

0110101

b)

0110011

c)

0110001

d)

0110000

109.

65. Encode a string "0111" with Hamming (7,4) code using thefollowing structure (i1, i2, i3, i4, r1, r2, r3)

a)

0111110

b)

0111000

c)

0111010

d)

0111011

110.

66. Encode a string "1000" with Hamming (7,4) code using thefollowing structure (i1, i2, i3, i4, r1, r2, r3)

a)

1000111

b)

1000100

c)

1000101

d)

1000001

111.

67. Encode a string "1001" with Hamming (7,4) code using thefollowing structure (i1, i2, i3, i4, r1, r2, r3)

a)

1001111

b)

1001010

c)

1001110

d)

1001100

112.

68. Encode a string "1010" with Hamming (7,4) code using thefollowing structure (i1, i2, i3, i4, r1, r2, r3)

a)

1010111

b)

1010001

c)

1010011

d)

1010010

113.

69. Encode a string "1011" with Hamming (7,4) code using thefollowing structure (i1, i2, i3, i4, r1, r2, r3)

a)

1011100

b)

1011010

c)

1011000

d)

1011001

114.

In digital communication system, smaller the code rate, ... are the redundant bits.

a)

less

b)

equal

c)

more

d)

unpredictable

115.

Main idea of error control codes is

a)

To add some redundancy

b)

To delete some redundancy

c)

To double all bits

d)

None of the given

116.

Noise affects ...

a)

information source

b)

receiver

c)

channel

d)

transmitter

117.

Shannon-Fano and Huffman codes are an encoding algorithms used for

a)

lossy data compression

b)

lossless data compression

c)

error correction

d)

error detection

118.

Specify the case when entropy is maximum

a)

p1=0,5 and p2=0,5

b)

p1=1 and p2=0

c)

p1=0 and p2=1

d)

p1=0,9 and p2=0,1

119.

Specify the error position in the string "0001110", if the initial string was encoded with Hamming (7,4) code using the following structure (i1, i2, i3, i4, r1, r2, r3)

a)

i4

b)

i1

c)

i2

d)

r2

120.

98. Specify the error position in the string "1000110", if the initial string was encoded with Hamming (7,4) code using the following structure (i1, i2, i3, i4, r1, r2, r3)

a)

i1

b)

i4

c)

i2

d)

i3

121.

 99. Specify the error position in the string "1001010", if the initial string was encoded with Hamming (7,4) code using the following structure (i1, i2, i3, i4, r1, r2, r3)

a)

r2

b)

r1

c)

r3

d)

i3

122.

 100. Specify the error position in the string "1001100", if the initial string was encoded with Hamming (7,4) code using the following structure (i1, i2, i3, i4, r1, r2, r3)

a)

r3

b)

r2

c)

r1

d)

no error

123.

101. Specify the error position in the string "1001110", if the initial string was encoded with Hamming (7,4) code using the following structure (i1, i2, i3, i4, r1, r2, r3)

a)

r1

b)

no error

c)

r2

d)

i4

124.

102. Specify the error position in the string "1001111", if the initial string was encoded with Hamming (7,4) code using the following structure (i1, i2, i3, i4, r1, r2, r3)

a)

r1

b)

r3

c)

r2

d)

i4

125.

103. Specify the error position in the string "1011110", if the initial string was encoded with Hamming (7,4) code using the following structure (i1, i2, i3, i4, r1, r2, r3)

a)

i1

b)

i3

c)

i2

d)

i4

126.

104. Specify the error position in the string "1101110", if the initial string was encoded with Hamming (7,4) code using the following structure (i1, i2, i3, i4, r1, r2, r3)

a)

i1

b)

i2

c)

i3

d)

i4

127.

Specify the formula to find the amount of information if events have different probabilities.

a)

Hartley's formula

b)

Shannon's formula

c)

Fano's formula

d)

Bayes' formula

128.

106. Specify the formula to find the amount of information if events have the same probabilities.

a)

Shannon's formula

b)

Hartley's formula

c)

Fano's formula

d)

Bayes' formula

129.

107. Specify the right formula if dmin is Hamming distance, s - number of correctable errors and r - number of detecteable errors.

a)

dmin>= s+r+1

b)

dmin>= 2s+r+1

c)

dmin>= s+2r+1

d)

dmin>= s+r+2

130.

108. Suppose the letters a, b, c, d, e, f have probabilities 1/2, 1/4, 1/8, 1/16, 1/32, 1/32 respectively. Which of the following is the Huffman code for the letter a, b, c, d, e, f?

a)

11, 10, 011, 010, 001, 000

b)

0, 10, 110, 1110, 11110, 11111

c)

11, 10, 01, 001, 0001, 0000

d)

110, 100, 010, 000, 001, 111

131.

109. Suppose the letters a, b, c, d, e, f have probabilities 1/2, 1/4, 1/8, 1/16, 1/32, 1/32 respectively. What is the average length q of the Huffman code?

a)

3,0

b)

1,9

c)

2,7

d)

4,3

132.

110. The amount of information in the message is 120 bits. Calculate the length of this message, which is written by characters of 16-character alphabet.

a)

30

b)

480

c)

120

d)

130

133.

111. The amount of information in the message is 60 bits. Calculate the length of this message, which is written by characters of 4-character alphabet.

a)

30

b)

60

c)

15

d)

510

134.

112. The basic idea behind Shannon-Fano coding is to

a)

compress data by using more bits to encode more frequently occuring characters

b)

compress data by using fewer bits to encode more frequently occuring characters

c)

compress data by using fewer bits to encode fewer frequently occuring characters

d)

expand data by using fewer bits to encode more frequently occuring characters

135.

113. The efficiency of the language is 0,25 and its I average is 1 bit. Calculate the number of letters in this language's alphabet?

a)

32

b)

16

c)

8

d)

64

136.

We can divide coding schemes into two broad categories: ________ and ______coding

a)

A) block; linear

b)

B) linear; nonlinear

c)

C) block; convolution

d)

D) none of the given

137.

What is the first step of Shannon-Fano algorithm?

a)

A) Characters of the original alphabet are setted in descending order of probability

b)

B) Letters divided to the two subsets so that the overall probability of these subsets were about    equal.

c)

C) For all characters (letters) of the top subset assign a code element 1, and for characters of the             lower subset the 0 code.

d)

D) For all characters (letters) of the top subset assign a code element 0, and for characters of the             lower subset the 1 code.

138.

What is the Hamming distance between two strings of equal length?

a)

A) the number of positions at which the corresponding symbols are different

b)

B) the number of positions at which the corresponding symbols are equal

c)

C) the number of identical symbols in the first string

d)

D) the number of identical symbols in the second string

139.

. What is the meaning of number “2” in the formula I = n*log2m?

a)

A) Binary number system

b)

B) Message length equals to 2

c)

C) It hasn’t any meaning

d)

D) Information is measured in nits

140.

What is the sample space of one dice roll?

a)

A) {1,2,3,4,5,6}

b)

B) {1,3,5}

c)

C) {2,4,6}

d)

D) {1,2,3,4,5,6,7,8,9,10,11,12}

141.

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

a)

A) bytes

b)

B) dits

c)

C) nits

d)

D) bits

142.

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

a)

A) bytes

b)

B) bits

c)

C) nits

d)

D) dits

143.

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

a)

A) bytes

b)

B) nits

c)

C) dits

d)

D) bits

144.

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

a)

A) c

b)

B) r

c)

C) d

d)

D) a

145.

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

a)

A) 10,011,11,001,010

b)

B) 0,10,110,1110,1111

c)

C) 10,01,0001,100,1010

d)

D) 100,110,001,000,010

146.

Which of the following codes has the highest code rate?

a)

A) code rate is constant for all of the Hamming codes

b)

B) Hamming (31,26)

c)

C) Hamming (15,11)

d)

D) Hamming (7,4)

147.

Which of the following codes has the highest redundancy?

a)

A) redundancy is constant for all of the Hamming codes

b)

B) Hamming (7,4)

c)

C) Hamming (15,11)

d)

D) Hamming (31,26)

148.

Which of the following codes is prefix?

a)

A) 0, 111, 11

b)

B) 0, 111, 10

c)

C) 0, 101, 10

d)

D) 00, 10, 101

149.

Which of the following codes is prefix?

a)

A) 0, 01, 11

b)

B) 0, 10, 11

c)

C) 0, 10, 1

d)

D) 0, 01, 001

150.

Which of the following codes is uniform?

a)

A) ASCII

b)

B) Shannon-Fano

c)

C) Huffman

d)

D) None of the given

151.

Which of the following codes is uniform?

a)

A) 10,011,11,001,010

b)

B) 0,10,110,1110,1111

c)

C) 10,01,0001,100,1010

d)

D) 100,110,001,000,010

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?

a)

A) c

b)

B) a

c)

C) d

d)

D) b

Similar Resources on Wayground

155 final

157 questions

155 final

quiz

Worksheet

•

University