Parity overhead: “The odd/even parity system would require a sixth bit to be added to a 4-bit data word.” This statement is ________.

Introduction / Context:
Parity adds a single bit to a data word to enable simple single-bit error detection. The item claims that a 4-bit word would need two extra bits (making “a sixth bit”), which overstates the overhead. Understanding how parity is formed clarifies the correct number of added bits.

Given Data / Assumptions:

• Data word length: 4 bits.
• Parity scheme: either odd or even parity (both use one parity bit).
• No mention of multi-dimensional parity or longitudinal redundancy checks.

Concept / Approach:
In classic parity systems, exactly one parity bit is appended to any length of data word to force the total count of 1s to be odd (odd parity) or even (even parity). Thus, an n-bit word becomes n+1 bits. For a 4-bit word, total length becomes 5 bits, not 6.

Step-by-Step Solution:

Verification / Alternative check:
Look at standard UART framing: a user may enable 1 parity bit in addition to data bits. There is never a doubling to two parity bits for basic odd/even parity in such systems.

Why Other Options Are Wrong:

• Correct/only for odd parity: Both odd and even parity use one additional bit.
• Two stop bits: Stop bits are framing elements, not parity; they do not change the single parity-bit rule.
• LRC instead of parity: LRC is a different checksum mechanism; the claim concerns simple parity only.

Common Pitfalls:
Confusing parity with checksums/CRCs; assuming one parity bit per nibble or per byte; misinterpreting stop bits as parity bits.

Final Answer:
Incorrect