Difficulty: Easy
Correct Answer: 10111100
Explanation:
Introduction / Context:An exclusive-OR (XOR) gate outputs logic 1 if and only if the number of 1s at its inputs is odd. Multi-input XORs are common in parity generators/checkers and error-detection coding. Recognizing the odd-parity rule enables quick mental evaluation without writing full truth tables.
Given Data / Assumptions:
Concept / Approach:Count the number of 1s in each candidate bit pattern. Odd count implies Y = 1; even count implies Y = 0. This is equivalent to computing parity of the vector.
Step-by-Step Solution:
Option A: 10111100 has five 1s (odd) => Y = 1.Option B: 10111000 has four 1s (even) => Y = 0.Option C: 11100111 has six 1s (even) => Y = 0.Option D: 00011101 has four 1s (even) => Y = 0.Verification / Alternative check:Pairwise XOR accumulation confirms the same results: XOR of an odd number of 1s yields 1; XOR of an even number of 1s yields 0. Using parity intuition gives identical outcomes.
Why Other Options Are Wrong:
Common Pitfalls:Miscounting the ones; confusing XOR with XNOR (which outputs 1 for an even number of 1s). Always confirm the odd vs. even parity rule for XOR vs. XNOR respectively.
Final Answer:10111100
Discussion & Comments