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
0 of 14 questions completed
I hope this quiz will somehow help you gain confidence in taking your examinations.
You have already completed the quiz before. Hence you can not start it again.
Quiz is loading...
You must sign in or sign up to start the quiz.
You have to finish following quiz, to start this quiz:
0 of 14 questions answered correctly
Time has elapsed
You have reached 0 of 0 points, (0)
- Error Detection and Correction 0%
Thank you for taking the quiz. I wish nothing but the best in your studies especially in your licensure examinations.
|Table is loading|
|No data available|
1. Question1 points
In ________ error correction, the receiver asks the sender to send the data again.
2. Question1 points
We add r redundant bits to each block to make the length n = k + r. The resulting n-bit blocks are called _________.
3. Question1 points
________ codes are special linear block codes with one extra property. If a codeword is rotated, the result is another codeword.
4. Question1 points
The divisor in a cyclic code is normally called the _________.
5. Question1 points
Which error detection method consists of just one redundant bit per data unit?
6. Question1 points
In a linear block code, the _______ of any two valid codewords creates another valid codeword.
7. Question1 points
The ________ of errors is more difficult than the ________.
8. Question1 points
A _______ error means that two or more bits in the data unit have changed.
9. Question1 points
In block coding, if k = 2 and n = 3, we have _______ invalid codewords.
10. Question1 points
Which error detection method uses one’s complement arithmetic?
11. Question1 points
The checksum of 0000 and 0000 is __________.
12. Question1 points
In modulo-2 arithmetic, __________ give the same results.
13. Question1 points
To guarantee correction of up to 5 errors in all cases, the minimum Hamming distance in a block code must be ________.
14. Question1 points
In modulo-11 arithmetic, we use only the integers in the range ______, inclusive.
More Practice Quiz in Error Detection and Correction
Complete Practice Quiz in Data Communications and Networking
Note: After taking this particular quiz, you can proceed to check all the topics.