QUESTION 1

What is the quotient and the remainder when dividing 1101101011 by 10101 modulo 2?

		Quotient is 1100; remainder is 101
		Quotient is 111011; remainder is 1100
		Quotient is 101111; remainder is 1011

QUESTION 2

What is the quotient and the remainder when dividing 1111101011 by 101101 modulo 2?

		Quotient is 11010; remainder is 1001
		Quotient is 11101; remainder is 1100
		Quotient is 1111; remainder is 1001

QUESTION 3

What is the quotient and the remainder when dividing 111110001 by 1001 modulo 2?

		Quotient is 11010; remainder is 101
		Quotient is 11100; remainder is 1
		Quotient is 111001; remainder is 0

QUESTION 4

What is the quotient and the remainder when dividing 111101010 by 10011 modulo 2?

		Quotient is 11111; remainder is 1
		Quotient is 11111; remainder is 1011
		Quotient is 11100; remainder is 1110

QUESTION 5

CRCs use systematic error detection.

True

False

QUESTION 6

What is the CRC code word for the information word 01010101, using the CRC polynomial 1001 ?

		01010101110
		01010101111
		11010100110

QUESTION 7

Which of the following is true?

		CRC algorithm can be used to correct one bit errors.
		Hamming algorithm can be used to correct one and two bit errors.
		none of the above

QUESTION 8

What is the CRC code word for the information word 01010101, using the CRC polynomial 1101 ?

		01010101000
		01010101100
		00110101011

QUESTION 9

Using the Hamming algorithm (presented in your text) and even parity, find the code word to represent the 8-bit information word 10011011. Select correct answer.

		100001011111
		100101011111
		100101011100

QUESTION 10

Using the Hamming algorithm (presented in your text) and even parity, find the code word to represent the 8-bit information word 01001000. Select correct answer.

		010011001001
		010011001000
		010011001011

QUESTION 11

If the ASCII code for A is 1000001, what is the ASCII code for J ?

		1001010
		1001011
		none of the above