Practice Quiz in Error Detection and Correction Part 3

This is the Online Practice Quiz in Error Detection and Correction part 3 from the book, Data Communications and Networking 4th Edition by Behrouz A. Forouzan. If you are looking for a reviewer in Electronics Systems and Technologies (Communications Engineering) this will definitely help you test your knowledge and skill before taking the Board Exam.

Continue Part III of the Online Practice Quiz

Quiz in Error Detection and Correction Question 21. In ________ error correction, the receiver asks the sender to send the data again. A. forward B. backward C. retransmission D. None of these Question 22. We add r redundant bits to each block to make the length n = k + r. The resulting n-bit blocks are called _________. A. codewords B. datawords C. blockwords D. none of these Question 23. _______codes are special linear block codes with one extra property. If a codeword is rotated, the result is another codeword. A. Convolution B. Cyclic C. Non-linear D. none of these Question 24. The divisor in a cyclic code is normally called the _________. A. redundancy B. degree C. generator D. none of these Question 25. Which error detection method consists of just one redundant bit per data unit? A. CRC B. Checksum C. Simple parity check D. Two-dimensional parity check Question 26. In a linear block code, the _______ of any two valid codewords creates another valid codeword. A. ANDing B. XORing C. ORing D. none of these Question 27. The _______of errors is more difficult than the ______. A. detection; correction B. correction; detection C. creation; correction D. creation; detection Question 28. A _____ error means that two or more bits in the data unit have changed. A. burst B. double-bit C. single-bit D. None of these Question 29. In block coding, if k = 2 and n = 3, we have _______ invalid codewords. A. 4 B. 8 C. 2 D. None of these Question 30. Which error detection method uses one's complement arithmetic? A. Checksum B. CRC C. Simple parity check D. Two-dimensional parity check Question 31. The checksum of 0000 and 0000 is __________. A. 0000 B. 1111 C. 0111 D. 1110 Question 32. In modulo-2 arithmetic, __________ give the same results. A. addition and subtraction B. addition and multiplication C. addition and division D. none of these Question 33. To guarantee correction of up to 5 errors in all cases, the minimum Hamming distance in a block code must be ________. A. 11 B. 6 C. 5 D. none of these Question 34. In modulo-11 arithmetic, we use only the integers in the range ______, inclusive. A. 1 to 10 B. 0 to 10 C. 1 to 11 D. none of these

More Practice Quiz in Error Detection and Correction

Practice Quiz Part 1

Practice Quiz Part 2

Practice Quiz Part 3

Complete Practice Quiz in Data Communications and Networking

Note: After taking this particular quiz, you can proceed to check all the topics.

Complete Practice Quiz in Data Communications and Networking

---