Docsity
Docsity
Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity

Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan

Guidelines and tips
Guidelines and tips
Sell on Docsity
Sell on Docsity
Docsity AI
Docsity AI
Log inSign up

Prepare for your exams

Study with the several resources on Docsity

Find documents

Prepare for your exams with the study notes shared by other students like you on Docsity

Search for your university

Find the specific documents for your university's exams

Docsity AINEW

Summarize your documents, ask them questions, convert them into quizzes and concept maps

Explore questions

Clear up your doubts by reading the answers to questions asked by your fellow students

Earn points to download

Earn points by helping other students or get them with a premium plan

Share documents
download point icon20 Points

For each uploaded document

Answer questions
download point icon5 Points

For each given answer (max 1 per day)

All the ways to get free points
Get points immediately

Choose a premium plan with all the points you need

Study Opportunities

Choose your next study program

Get in touch with the best universities in the world. Search through thousands of universities and official partners

Community

Ask the community

Ask the community for help and clear up your study doubts

Free resources

Our save-the-student-ebooks!

Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors

Error Correction and Detection Quiz: Test Your Knowledge, Exams of Advanced Education

University of LimpopoAdvanced Education

A set of multiple-choice questions focused on error correction and detection techniques in data transmission and storage. It covers topics such as checksums, cyclic redundancy checking (crc), hamming distance, modulo arithmetic, and different coding schemes. The quiz is designed to test understanding of key concepts and methods used to ensure data integrity. It is useful for students and professionals in computer science, networking, and related fields.

Typology: Exams

2025/2026

Available from 12/31/2025

alex-david-34
alex-david-34 🇿🇦

4.5

(4)

5.6K documents

1 / 6

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
ERROR CORRECTION AND DETECTION
1. Checksums use _________
arithmetic.
A) one's complement arithmetic
B) two's complement arithmetic
C) either (a) or (b)
D) none of the above
A
2. The checksum of 1111 and 1111 is_________.
A) 0000
B) 1111
C) 1110
D) 0111
A
3. 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 the above
B
4. In cyclic redundancy checking, the
divisor is _______ the CRC.
A) one bit less than
B) one bit more than
C) The same size as
D) none of the above
B
5. The ________ between two words is the number of differences between
corresponding bits.
A) Hamming rule
B) Hamming code
C) Hamming distance
D) none of the above
C
6. The _______ of a polynomial is the highest power in the polynomial.
A) range
B) power
C) degree
D) none of the above
pf3
pf4
pf5

Partial preview of the text

Download Error Correction and Detection Quiz: Test Your Knowledge and more Exams Advanced Education in PDF only on Docsity!

ERROR CORRECTION AND DETECTION

  1. Checksums use _________ arithmetic. A) one's complement arithmetic B) two's complement arithmetic C) either (a) or (b) D) none of the above A
  2. The checksum of 1111 and 1111 is_________. A) 0000 B) 1111 C) 1110 D) 0111 A
  3. 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 the above B
  4. In cyclic redundancy checking, the divisor is _______ the CRC. A) one bit less than B) one bit more than C) The same size as D) none of the above B
  5. The ________ between two words is the number of differences between corresponding bits. A) Hamming rule B) Hamming code C) Hamming distance D) none of the above C
  6. The _______ of a polynomial is the highest power in the polynomial. A) range B) power C) degree D) none of the above

C

  1. In modulo-2 arithmetic, __________ give the same results. A) addition and subtraction B) addition and multiplication C) addition and division D) none of the above A
  2. In cyclic redundancy checking, what is the CRC? A) The quotient B) The dividend C) The divisor D) The remainder D
  3. 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 C
  4. In _____ coding, we divide our message into blocks, each of k bits, called ___. A) block; blockwords B) block; datawords C) linear; datawords D) none of the above B
  5. 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 the above A
  6. Adding 1 and 1 in modulo- arithmetic results in _________. A) 0 B) 1 C) 2 D) none of the above A
  7. In ________ error correction, the receiver corrects errors without requesting retransmission. A) onward B) forward C) backward D) none of the above B

B

  1. 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 the above A
  2. The _____of errors is more difficult than the ______. A) detection; correction B) correction; detection C) creation; correction D) creation; detection B
  3. In block coding, if k = 2 and n = 3, we have _______ invalid codewords. A) 4 B) 8 C) 2 D) none of the above A
  4. The checksum of 0000 and 0000 is __________. A) 0000 B) 1111 C) 0111 D) 1110 B
  5. In one's complement arithmetic, if positive 7 is 0111, then negative 7 is ________. A) 1101 B) 1000 C) 1111 D) NONE OF THE ABOVE B
  6. In block coding, if n = 5, the maximum Hamming distance between two codewords is ________. A) 5 B) 3 C) 2 D) none of the above A
  7. Which error detection method uses one's complement arithmetic? A) Checksum B) CRC

C) Simple parity check D) Two-dimensional parity check A

  1. The divisor in a cyclic code is normally called the _________. A) redundancy B) degree C) generator D) none of the above C
  2. In modulo-2 arithmetic, we use the ______ operation for both addition and subtraction. A) OR B) XOR C) AND D) none of the above B
  3. 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 the above A
  4. To guarantee the detection of up to 5 errors in all cases, the minimum Hamming distance in a block code must be _______. A) 11 B) 5 C) 6 D) none of the above C
  5. A generator that contains a factor of ____ can detect all odd-numbered errors. A) x B) 1 C) x + 1 D) none of the above C
  6. _______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 the above B