Вы находитесь на странице: 1из 4

# A Complete Chapter Quiz

## Error Detection and Correction

Compilation of all the quizzes (MCQs) for each and every chapters in the book of Data
Communications and Networking 4th Edition by Behrouz A. Forouzan.

1|P age
MCQs in Error Detection and Correction
www.PinoyBIX.com
1. Checksums use _________ 7. In modulo-2 arithmetic, __________
arithmetic. give the same results.
A) one's complement arithmetic A) addition and subtraction
B) two's complement arithmetic B) addition and multiplication
C) either (a) or (b) C) addition and division
D) none of the above D) none of the above
2. The checksum of 1111 and 1111 is 8. In cyclic redundancy checking, what is
_________. the CRC?
A) 0000 A) The quotient
B) 1111 B) The dividend
C) 1110 C) The divisor
D) 0111 D) The remainder
3. In modulo-11 arithmetic, we use only 9. Which error detection method consists
the integers in the range ______, of just one redundant bit per data unit?
inclusive. A) CRC
A) 1 to 10 B) Checksum
B) 0 to 10 C) Simple parity check
C) 1 to 11 D) Two-dimensional parity check
D) none of the above 10. In _____ coding, we divide our
4. In cyclic redundancy checking, the message into blocks, each of k bits,
divisor is _______ the CRC. called ___.
A) one bit less than A) block; blockwords
B) one bit more than B) block; datawords
C) The same size as C) linear; datawords
D) none of the above D) none of the above
5. The ________ between two words is 11. A _____ error means that two or
the number of differences between more bits in the data unit have changed.
corresponding bits. A) burst
A) Hamming rule B) double-bit
B) Hamming code C) single-bit
C) Hamming distance D) none of the above
D) none of the above 12. Adding 1 and 1 in modulo-2
6. The _______ of a polynomial is the arithmetic results in _________.
highest power in the polynomial. A) 0
A) range B) 1
B) power C) 2
C) degree D) none of the above
D) none of the above

2|P age
MCQs in Error Detection and Correction
www.PinoyBIX.com
13. In ________ error correction, the B) backward
receiver corrects errors without C) retransmission
requesting retransmission. D) none of the above
A) onward 19. We can divide coding schemes into
B) forward two broad categories: ________ and
C) backward ______coding.
D) none of the above A) linear; nonlinear
14. If the Hamming distance between a B) block; convolution
dataword and the corresponding C) block; linear
codeword is three, there are _____ bits D) none of the above
in error. 20. In modulo-2 arithmetic, we use only
A) 5 ______.
B) 4 A) 1 and 2
C) 3 B) 0 and 1
D) none of the above C) 0 and 2
15. A simple parity-check code can D) none of the above
detect __________ errors. 21. To guarantee correction of up to 5
A) an odd-number of errors in all cases, the minimum
B) an even-number of Hamming distance in a block code must
C) two be ________.
D) no errors A) 11
16. The Hamming distance between B) 6
equal codewords is _________. C) 5
A) 0 D) none of the above
B) 1 22. The _____of errors is more difficult
C) n than the ______.
D) none of the above A) detection; correction
17. In a linear block code, the _______ of B) correction; detection
any two valid codewords creates another C) creation; correction
valid codeword. D) creation; detection
A) ANDing 23. In block coding, if k = 2 and n = 3, we
B) XORing have _______ invalid codewords.
C) ORing A) 4
D) none of the above B) 8
18. In ________ error correction, the C) 2
receiver asks the sender to send the data D) none of the above
again. 24. The checksum of 0000 and 0000 is
A) forward __________.

3|P age
MCQs in Error Detection and Correction
www.PinoyBIX.com
A) 0000 30. We add r redundant bits to each block
B) 1111 to make the length n = k + r. The resulting
C) 0111 n-bit blocks are called _________.
D) 1110 A) codewords
25. In one's complement arithmetic, if B) datawords
positive 7 is 0111, then negative 7 is C) blockwords
________. D) none of the above
A) 1101 31. To guarantee the detection of up to 5
B) 1000 errors in all cases, the minimum
C) 1111 Hamming distance in a block code must
D) none of the above be _______.
26. In block coding, if n = 5, the maximum A) 11
Hamming distance between two B) 5
codewords is ________. C) 6
A) 5 D) none of the above
B) 3 32. A generator that contains a factor of
C) 2 ____ can detect all odd-numbered errors.
D) none of the above A) x
27. Which error detection method uses B) 1
one's complement arithmetic? C) x + 1
A) Checksum D) none of the above
B) CRC 33. _______codes are special linear
C) Simple parity check block codes with one extra property. If a
D) Two-dimensional parity check codeword is rotated, the result is another
28. The divisor in a cyclic code is codeword.
normally called the _________. A) Convolution
A) redundancy B) Cyclic
B) degree C) Non-linear
C) generator D) none of the above
D) none of the above 34. The Hamming distance between 100
29. In modulo-2 arithmetic, we use the and 001 is ________.
______ operation for both addition and A) 0
subtraction. B) 1
A) OR C) 2
B) XOR D) none of the above
C) AND
D) none of the above

4|P age
MCQs in Error Detection and Correction
www.PinoyBIX.com