Difficulty: Easy
Correct Answer: indeterminate
Explanation:
Introduction:
Parity is a simple error-detection method that constrains the count of 1s or 0s in a transmitted symbol. When using odd parity, the total number of 1s in the codeword (data bits plus parity bit) is forced to be odd. This question probes whether that constraint uniquely determines the number of 0s.
Given Data / Assumptions:
Concept / Approach:
If the number of 1s is constrained to be odd, the number of 0s equals 8 minus the number of 1s. Because “odd” could be 1, 3, 5, or 7 ones, the number of 0s could be 7, 5, 3, or 1 respectively. Therefore the number of 0s is not fixed—it varies with the data. The only thing determined by odd parity is the parity of the 1s count, not the exact zero count.
Step-by-Step Solution:
Let ones = any odd value in {1, 3, 5, 7} (theoretically 9 is impossible in 8 bits).Compute zeros = 8 − ones; possible zeros ∈ {7, 5, 3, 1}.Observe that zeros are neither always odd nor always even.Conclude the correct description is “indeterminate.”
Verification / Alternative check:
Test examples: send 0000000 (seven zeros) with parity 1 → 1 one and 7 zeros; send 1110000 with parity 0 → 4 ones (not allowed with odd parity), adjust to 1110001 → 5 ones and 3 zeros. The zeros count changes across valid codewords.
Why Other Options Are Wrong:
Common Pitfalls:
Assuming that constraining ones also constrains zeros to a fixed parity. In fixed-length words, zeros parity flips as data changes.
Final Answer:
indeterminate
Discussion & Comments