Even-parity check: For the 9-bit data word 100111100, determine whether an even-parity system with parity bit = 0 is a correct combination (i.e., total number of 1s must be even).

Introduction / Context:
Parity bits provide simple error detection. In an even-parity system, the total count of 1s across the data bits plus the parity bit must be even. Verifying parity requires counting ones accurately and checking whether the parity setting produces an even total.

Given Data / Assumptions:

• Data word: 100111100 (9 bits).
• Parity scheme: even parity.
• Proposed parity bit value: 0.

Concept / Approach:
Count the number of 1s in the data. If the count is odd, the parity bit must be 1 to make the total even; if the count is even, the parity bit should be 0. This is independent of byte ordering or endianness since parity is a scalar property of the bit set.

Step-by-Step Solution:

Verification / Alternative check:

Why Other Options Are Wrong:

Common Pitfalls:

Final Answer: