136-152

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

• block; linear

• linear; nonlinear

• block; convolution

• none of the given

What is the first step of Shannon-Fano algorithm?

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

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

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

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

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

• the number of positions at which the corresponding symbols are different

• the number of positions at which the corresponding symbols are equal

• the number of identical symbols in the first string

• the number of identical symbols in the second string

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

• Binary number system

• Message length equals to 2

• It hasn’t any meaning

• Information is measured in nits

What is the sample space of one dice roll?

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

• {1,3,5}

• {2,4,6}

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

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

• bytes

• dits

• nits

• bits

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

• bytes

• bits

• nits

• dits

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

• bytes

• nits

• dits

• bits

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

• C

• R

• D

• A

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