Wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

Theory of information

Total questions: 191

Worksheet time: 2hrs 10mins

Name
Class
Date
1.

... is a measure of uncertainty

a)

Encoding

b)

Entropy

c)

Information

d)

Redundancy

2.

{1,2,3,4,5,6} is the sample space of ...

a)

one coin toss

b)

one dice roll

c)

sum of two dice

d)

removing a card from the standard deck

3.

A card is drawn from a pack of 52 cards. The probability of getting a king of heart is

a)

1/26

b)

1/52

c)

1/13

d)

2/12

4.

A card is drawn from a pack of 52 cards. The probability of getting a queen or a king of heart is

a)

1/52

b)

1/26

c)

1/13

d)

2/13

5.

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

a)

101

b)

010

c)

001

d)

None

6.

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

7.

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

a)

010

b)

101

c)

000

d)

None

8.

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

a)

101

b)

010

c)

111

d)

None

9.

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

a)

010

b)

101

c)

011

d)

None

10.

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

a)

010

b)

101

c)

110

d)

None

11.

A fair coin is tossed four times, the probability of getting four heads is

a)

1/4

b)

1/16

c)

1

d)

1/2

12.

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

13.

A redundancy of a code S = ...

a)

1 - Iavr/Imax

b)

Iavr/Imax

c)

1 + Iavr/Imax

d)

Imax/Iavr

14.

An alphabet consist of the letters a, b, c and d. The probability of occurrence is \n p(a) = 0.4, p(b) = 0.1, p(c) = 0.2 and p(d) = 0.3. The Huffman code is

a)

a=0,b=111,c=11,d=101

b)

a=0,b=110,c=111,d=10

c)

a=0,b=11,c=10,d=111

d)

a=01,b=111,c=110,d=10

15.

An average length of codewords qavr = ...

a)

∑ (pi * qi)

b)

∑ (pi / qi)

c)

∑ pi

d)

∑ qi

16.

An efficiency of a code E = ...

a)

Iavr/Imax

b)

Imax/Iavr

c)

Iavr/100

d)

Imax - Iavr

17.

ASCII code is a

a)

Variable length code

b)

Fixed length code

c)

Error-correction code

d)

None of the given

18.

Bag contain 10 black and 20 white balls, One ball is drawn at random. What is the probability that ball is white

a)

1

b)

2/3

c)

1/3

d)

4/3

19.

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

a)

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

b)

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

c)

H(X|Y) - H(X)

d)

H(X|Y)+ H(Y)

20.

By the Bayes' theorem ...

a)

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

b)

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

c)

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

d)

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

21.

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

a)

H(X)

b)

H(Y)

c)

H(Y|X)

d)

H(X|Y)

22.

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

a)

I = n*log m

b)

I = m*n

c)

I = log (m/n)

d)

I = log (m*n)

23.

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)

24.

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

25.

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)

26.

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)

27.

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)

28.

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

a)

1

b)

0,733

c)

0,571

d)

0,839

29.

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

a)

1

b)

0,839

c)

0,733

d)

0,571

30.

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

a)

1

b)

0,571

c)

0,733

d)

0,839

31.

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)

1

32.

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

33.

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)

N = mn

b)

N = nm

c)

N = m*n

d)

N = log m

34.

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

a)

2

b)

3

c)

0

d)

1

35.

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

a)

2

b)

3

c)

0

d)

1

36.

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

a)

4

b)

8

c)

9

d)

10

37.

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

a)

11

b)

7

c)

5

d)

10

38.

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

a)

5

b)

9

c)

10

d)

11

39.

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

a)

5

b)

10

c)

11

d)

12

40.

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

a)

2

b)

3

c)

0

d)

1

41.

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

a)

2

b)

3

c)

1

d)

0

42.

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

a)

2

b)

3

c)

1

d)

4

43.

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

a)

1

b)

3

c)

2

d)

4

44.

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

a)

5

b)

1

c)

3

d)

4

45.

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

a)

5

b)

3

c)

2

d)

4

46.

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

a)

6

b)

2

c)

4

d)

5

47.

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

a)

6

b)

2

c)

5

d)

4

48.

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

a)

5

b)

6

c)

3

d)

4

49.

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

a)

7

b)

3

c)

6

d)

5

50.

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

a)

8

b)

6

c)

7

d)

3

51.

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

a)

5

b)

7

c)

4

d)

8

52.

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

a)

7

b)

9

c)

8

d)

4

53.

Code is optimal when ...

a)

qavr = H

b)

qavr ≠H

c)

qavr<H

d)

qavr >H

54.

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

55.

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

56.

Conditional probability P(B|A) = ...

a)

P(A and B)/P(A)

b)

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

c)

P(A and B)*P(A)

d)

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

57.

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

a)

6

b)

5

c)

7

d)

9

58.

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

a)

5

b)

4

c)

6

d)

8

59.

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

a)

9

b)

8

c)

10

d)

14

60.

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

a)

0000001

b)

0000111

c)

0000000

d)

0000101

61.

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

a)

0001010

b)

0001001

c)

0001011

d)

0001111

62.

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

a)

0010010

b)

0010111

c)

0010110

d)

0010100

63.

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

a)

0011100

b)

0011001

c)

0011101

d)

0011111

64.

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

a)

0100011

b)

0100110

c)

0100111

d)

0100101

65.

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

a)

0101101

b)

0101000

c)

0101100

d)

0101110

66.

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

a)

0110101

b)

0110011

c)

0110001

d)

0110000

67.

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

a)

0111110

b)

0111000

c)

0111010

d)

0111011

68.

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

a)

1000111

b)

1000100

c)

1000101

d)

1000001

69.

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

a)

1001111

b)

1001010

c)

1001110

d)

1001100

70.

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

a)

1010111

b)

1010001

c)

1010011

d)

1010010

71.

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

a)

1011100

b)

1011010

c)

1011000

d)

1011001

72.

Encode a string "1100" with Hamming (7,4) code using the following structure (i1, i2, i3, i4, r1, r2, r3)

a)

1100110

b)

1100000

c)

1100010

d)

1100011

73.

Encode a string "1101" with Hamming (7,4) code using the following structure (i1, i2, i3, i4, r1, r2, r3)

a)

1101101

b)

1101011

c)

1101001

d)

1101000

74.

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

a)

1110000

b)

1110101

c)

1110100

d)

1110110

75.

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

a)

1111110

b)

1111011

c)

1111111

d)

1111101

76.

Find the information amount of a symbol from the language with total number of symbols n = 18

a)

I = log218

b)

I = log182

c)

I = 18 * log218

d)

I = 18 * log182

77.

For a Hamming (15, 11) code, 15 is the total number of bits and 11 is the number of ...

a)

redundant bits

b)

data bits

c)

parity bits

d)

none of the given

78.

For a Hamming (31, 26) code, 31 is the total number of bits and 26 is the number of ...

a)

redundant bits

b)

data bits

c)

parity bits

d)

none of the given

79.

For a Hamming (7, 4) code, 7 is the total number of bits and 4 is the number of ...

a)

redundant bits

b)

data bits

c)

parity bits

d)

none of the given

80.

For Hamming distance dmin and r errors in the received word, the condition to be able to detect the errors is

a)

dmin>= r+1

b)

dmin>= 2r+1

c)

dmin>= 2r+2

d)

dmin>= r+2

81.

For Hamming distance dmin and s errors in the received word, the condition to be able to correct the errors is

a)

dmin>= s+1

b)

dmin>= 2s+1

c)

dmin>= 2s+2

d)

dmin>= s+2

82.

Hamming distance can easily be found with ...

a)

XNOR operation

b)

XOR operation

c)

OR operation

d)

AND operation

83.

If a card is chosen from a pack of 52 cards, what is the probability of getting a five or a seven?

a)

4/52

b)

8/52

c)

1/26

d)

1/169

84.

In a box, there are 8 red, 7 blue and 6 green balls. One ball is picked up randomly. What is the probability that it is neither blue nor green?

a)

2/3

b)

8/21

c)

3/7

d)

9/22

85.

In a throw of coin what is the probability of getting head

a)

1

b)

1/2

c)

2

d)

0

86.

In a throw of coin what is the probability of getting tails

a)

1

b)

1/2

c)

2

d)

0

87.

In a throw of dice what is the probability of getting number greater than 5

a)

1/3

b)

1/6

c)

1/5

d)

1

88.

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

a)

less

b)

equal

c)

more

d)

unpredictable

89.

Noise affects ...

a)

information source

b)

receiver

c)

channel

d)

transmitter

90.

Probability of occurrence of an event lies between

a)

-1 and 0

b)

0 and 1

c)

-1 and 1

d)

exactly 1

91.

Probability of second event in situation if first event has been occurred is classified as

a)

conditional probability

b)

joint entropy

c)

conditional entropy

d)

none of the given

92.

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

93.

Specify parts of the receiver side

a)

Source encoder, channel encoder, digital modulator

b)

Source decoder, channel decoder, digital demodulator

c)

Source decoder, channel encoder, digital modulator

d)

Source encoder, channel decoder, digital modulator

94.

Specify parts of the transmitter side

a)

Source decoder, channel decoder, digital demodulator

b)

Source encoder, channel encoder, digital modulator

c)

Source decoder, channel encoder, digital modulator

d)

Source encoder, channel decoder, digital modulator

95.

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

96.

Specify the error position in the string "0000110", 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

97.

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

98.

Specify the error position in the string "0011001", 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

99.

Specify the error position in the string "0101011", 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

100.

Specify the error position in the string "0101110", 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

101.

Specify the error position in the string "0101111", 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

102.

Specify the error position in the string "0110000", 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

103.

Specify the error position in the string "1010011", 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

104.

Specify the formula to calculate numbers of k and n bits to create the Hamming code

a)

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

b)

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

c)

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

d)

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

105.

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

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

107.

Specify the most effective type of code when an alphabet consists of 2 symbols with probabilities p(x1) = 0,05 and p(x2) = 0,95.

a)

ASCII code

b)

Shannon-Fano's code

c)

Shannon-Fano's code by blocks

d)

Hartley's code

108.

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

a)

dmin>= s+r+1

b)

dmin>= 2s+r+1

c)

dmin>= s+2r+1

d)

dmin>= s+r+2

109.

Specify two types of error control algorithms

a)

block and linear

b)

linear and nonlinear

c)

block and convolution

d)

none of the given

110.

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

111.

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

112.

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)

60

113.

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

114.

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

115.

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

116.

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

a)

0

b)

1

c)

6

d)

impossible to detect

117.

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

a)

4

b)

3

c)

1

d)

impossible to detect

118.

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

a)

0

b)

4

c)

2

d)

impossible to detect

119.

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

a)

4

b)

3

c)

impossible to detect

d)

5

120.

The Hamming distance between 001111 and 010011 is

a)

1

b)

2

c)

3

d)

4

121.

The Hamming distance between 010111 and 010011 is

a)

2

b)

3

c)

1

d)

4

122.

The Hamming distance between 011111 and 010011 is

a)

1

b)

3

c)

2

d)

4

123.

The Hamming distance between 101001 and 010011 is

a)

1

b)

2

c)

4

d)

3

124.

The Hamming distance between two strings with equal length is ...

a)

the number of positions at which the corresponding symbols are different

b)

the number of positions at which the corresponding symbols are equal

c)

the number of identical symbols in the first string

d)

the number of identical symbols in the second string

125.

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

126.

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)

30

b)

6

c)

32

d)

24

127.

The number of digits by which any two binary sequences differ is called the ...

a)

Hamming weight

b)

Hamming distance

c)

Hamming code

d)

Hamming length

128.

The prefix code is also known as ...

a)

block code

b)

uniquely decodable code

c)

convolutional code

d)

parity bit

129.

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)

32

b)

16

c)

8

d)

64

130.

The string was encoded with Hamming (15,11) code using the transformation matrix. Specify numbers of positions of the parity bits.

a)

12,13,14,15

b)

1,2,3,4

c)

1,2,4,8

d)

2,3,4,5

131.

The string was encoded with Hamming (31,26) code using the transformation matrix. Specify numbers of positions of the parity bits.

a)

27,28,29,30,31

b)

1,2,3,4,5

c)

1,2,4,8,16

d)

2,3,4,5,6

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 000. Specify the position of the error

a)

i1

b)

r1

c)

no error

d)

r3

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 001. Specify the position of the error

a)

i1

b)

r1

c)

r3

d)

no error

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 010. Specify the position of the error

a)

r3

b)

r1

c)

r2

d)

i2

135.

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)

r4

b)

i1

c)

i4

d)

r1

136.

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)

r3

b)

i1

c)

r1

d)

r2

137.

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

138.

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)

i4

b)

r3

c)

i3

d)

i1

139.

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

b)

r2

c)

i2

d)

no error

140.

The string was encoded with Hamming (7,4) code using the transformation matrix. Specify numbers of positions of the parity bits

a)

5,6,7

b)

1,2,3

c)

1,2,4

d)

2,3,4

141.

What is the probability of getting a sum 9 from two throws of dice

a)

1/3

b)

1/9

c)

1/12

d)

2/9

142.

When data is compressed, the goal is to reduce

a)

noise

b)

redundancy

c)

channel capacity

d)

none of the given

143.

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

a)

bytes

b)

dits

c)

nits

d)

bits

144.

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

a)

bytes

b)

bits

c)

nits

d)

dits

145.

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

a)

bytes

b)

nits

c)

dits

d)

bits

146.

Which block or device does the data compression?

a)

Channel encoder

b)

Source encoder

c)

Modulator

d)

None of the given

147.

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

a)

c

b)

r

c)

d

d)

a

148.

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

a)

10,011,11,001,010

b)

0,10,110,1110,1111

c)

10,01,0001,100,1010

d)

100,110,001,000,010

149.

Which of the following codes has the highest code rate?

a)

code rate is constant for all of the Hamming codes

b)

Hamming (31,26)

c)

Hamming (15,11)

d)

Hamming (7,4)

150.

Which of the following codes has the highest redundancy?

a)

redundancy is constant for all of the Hamming codes

b)

Hamming (7,4)

c)

Hamming (15,11)

d)

Hamming (31,26)

151.

Which of the following codes is non-uniform?

a)

Shannon-Fano

b)

ASCII

c)

Hamming

d)

None of the given

152.

Which of the following codes is prefix?

a)

0 ,111, 11

b)

0, 111, 10

c)

0, 101, 10

d)

00, 10, 101

153.

Which of the following codes is prefix?

a)

0, 01, 11

b)

0, 10, 11

c)

0, 10, 1

d)

0, 01, 001

154.

Which of the following codes is uniform?

a)

ASCII

b)

Shannon-Fano

c)

Huffman

d)

None of the given

155.

Which of the following codes is uniform?

a)

10,011,11,001,010

b)

0,10,110,1110,1111

c)

10,01,0001,100,1010

d)

100,110,001,000,010

156.

Which of the following indicate(s) an error in a received combination?

a)

Parity bits

b)

Error syndrome

c)

Data bits

d)

None of the given

157.

Which of the following is a part the channel coding?

a)

Huffman code

b)

Hamming code

c)

Shannon-Fano code

d)

RLE code

158.

Which of the following is a part the source coding?

a)

Hamming code

b)

Huffman code

c)

Error-correcting code

d)

Convolutional code

159.

Which of the following is not a correct statement about a probability

a)

It must have a value between 0 and 1

b)

It is the collection of several experiments

c)

A value near 0 means that the event is not likely to occur/happens

d)

It can be reported as a decimal or a fraction

160.

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)

c

b)

a

c)

d

d)

b

161.

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

a)

data; parity

b)

with errors; without errors

c)

allowable; not allowable

d)

none of the given

162.

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

a)

pi < pj and li<=lj

b)

pi > pj and li<=lj

c)

pi > pj and li>=lj

d)

none of the given

163.

Convert the message into a signal suitable for transmission over the channel of communication, referred to as …

a)

Encoding

b)

Decoding

c)

Entropy

d)

Redundancy

164.

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

a)

from 7 to 11

b)

from 4 to 12

c)

from 6 to 10

d)

from 6 to 11

165.

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

a)

from 7 to 11

b)

from 4 to 12

c)

from 6 to 10

d)

from 6 to 11

166.

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

a)

2

b)

3

c)

1

d)

0

167.

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

168.

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

a)

11

b)

4

c)

15

d)

5

169.

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

a)

26

b)

31

c)

5

d)

4

170.

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

a)

4

b)

3

c)

7

d)

10

171.

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

a)

4

b)

15

c)

11

d)

5

172.

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

a)

26

b)

31

c)

5

d)

4

173.

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

a)

26

b)

31

c)

5

d)

4

174.

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

a)

3

b)

4

c)

7

d)

11

175.

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

176.

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

177.

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

a)

a

b)

b

c)

c

d)

none

178.

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

a)

1111

b)

1011

c)

0011

d)

0000

179.

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)

i4

b)

i1

c)

i2

d)

r2

180.

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

181.

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

182.

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

183.

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

184.

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

185.

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

186.

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

187.

The Hamming code is a method of ...

a)

Error control coding

b)

Optimal coding

c)

None of the above

188.

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)

Optional code

189.

What is the first step of Shannon-Fano algorithm?

a)

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

b)

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

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)

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

190.

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

a)

the number of positions at which the corresponding symbols are different

b)

 the number of positions at which the corresponding symbols are equal

c)

the number of identical symbols in the first string

d)

the number of identical symbols in the second string

191.

What is the sample space of one dice roll?

a)

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

b)

{1,3,5}

c)

{2,4,6}

d)

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

Similar Resources on Wayground

Database

192 questions

Database

quiz

Worksheet

•

University