Tip: Choose Save as PDF in the print dialog to download. Use A4 paper size.
Shade in the A or B circle for each question.
Draw a line connecting each item on the left to its match on the right.
| Left column | Right column | |
|---|---|---|
| 1Sent: 10, 20, 30 | Received: 30, 20, 10 | AA checksum cannot show which byte is wrong, so the receiver cannot tell that byte 3 is the problem. | |
| 2Sent: 10, 20, 30 | Received: 15, 20, 25 | BA matching checksum does not prove the data is correct, because swapped bytes or errors that cancel out give the same sum. | |
| 3A checksum is stronger than a single parity bit for a block because it detects most changes, losses and gains in the whole block. | COne byte went up by 5 and another down by 5, so the sum is unchanged and the error is missed. | |
| 4A checksum cannot show which byte is wrong: a mismatch only tells you that there is an error somewhere in the data. | DThe bytes are swapped but the sum is still 60, so the checksum matches and the error is missed. | |
| 5Checksums match, so the data must be perfect | ESent: 10, 20, 30, sum 60 | Received: 10, 20, sum 60 -> 30 is not 60, error found | |
| 6Checksum mismatch at byte 3, so resend byte 3 only | FSent sum 60, received sum 65 -> error, but which byte? |
Complete each line of code by filling in the missing parts.
Shade in the letter of the line that contains an error.
checksum — A sum of the data bytes sent with the data. It catches most changes, losses and gains, but misses swapped bytes or errors that cancel out, and cannot show which byte is wrong.sent ← 4 + 9 + 2
received ← 9 + 4 + 2
IF sent = received THEN OUTPUT "No error"sent ← 10 + 20 + 30
received ← 11 + 19 + 30
IF sent = received THEN OUTPUT "Missed"sent ← 8 + 5 + 7
received ← 8 + 5
IF sent ≠ received THEN OUTPUT "Error"IF sent ≠ received THEN
errorDetected ← TRUE
locationKnown ← FALSEsum1 ← byteA + byteB
sum2 ← byteB + byteA
OUTPUT sum1 = sum2