wayground logo

Free Printable Worksheets

NEW

Font size

S
M
L
XL
Worksheets

97-122

Total questions: 26

Worksheet time: 13mins

Name
Class
Date
1.

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

2.

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

3.

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

4.

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

5.

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

6.

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

7.

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

8.

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

9.

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

10.

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

11.

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

12.

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

13.

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

14.

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

15.

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

16.

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

17.

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

18.

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

19.

The Hamming code is a method of _______.

a)

Error control coding

b)

Optimal coding

c)

None of the above

20.

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

a)

0

b)

1

c)

6

d)

impossible to detect

21.

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

a)

4

b)

3

c)

1

d)

impossible to detect

22.

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

a)

0

b)

4

c)

2

d)

impossible to detect

23.

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

a)

4

b)

3

c)

5

d)

impossible to detect

24.

The Hamming distance between 001111 and 010011 is

a)

1

b)

2

c)

3

d)

4

25.

The Hamming distance between 010111 and 010011 is

a)

1

b)

2

c)

3

d)

4

26.

The Hamming distance between 011111 and 010011 is

a)

1

b)

2

c)

3

d)

4