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 | |
|---|---|---|
| 11010001 + 1 → 10100011 | AThe sender and receiver must agree on the same rule beforehand. Otherwise good data would look like errors. | |
| 20110100 → three 1s | B1100101 + 0 → 11001010 | |
| 3With an even parity rule, the parity bit makes the total number of 1s even | CSeven data bits with a parity bit added to the end to make the byte; here the parity bit is 1 | |
| 4With an odd parity rule, the parity bit makes the total number of 1s odd | DCounting the 1s in the data bits, which is the first step in deciding the parity bit | |
| 5Parity bit added to 7 data bits makes a 9-bit byte | E7 data bits plus 1 parity bit make 8 bits, not 9. The parity bit is only one extra bit. | |
| 6The sender picks even parity and the receiver picks odd parity | F1100101 + 1 → 11001011 |
Complete each line of code by filling in the missing parts.
Shade in the letter of the line that contains an error.
parity bit — One extra bit added to a group of bits (such as 7 data bits) so the total number of 1s follows a rule, even or odd, agreed by sender and receiver. It is used to detect errors.Data bits 1011011 contain 5 ones7 data bits + 1 parity bit = 8 bitsIF ones MOD 2 = 1 THEN parity ← 1
ELSE parity ← 0Data 1101100 with even parity: parity = 0IF ones MOD 2 = 0 THEN OUTPUT "OK"
ELSE OUTPUT "Error"