Correct option is C
From the truth table, Y = 1 for inputs A, B = (1, 0) and (0, 1), and Y = 0 for (0, 0) and (1, 1).
These are exactly the cases where A and B differ, i.e., the exclusive-OR function .
The minimal SOP form of XOR is .
Derivation via minterms: .
A 2-variable K-map groups each isolated 1; no larger grouping exists, confirming minimality.
Hence, the correct logic equation is .
The minimal SOP form of XOR is .
Derivation via minterms: .
A 2-variable K-map groups each isolated 1; no larger grouping exists, confirming minimality.
Hence, the correct logic equation is .
Important Key Points
- Function type: Truth table matches XOR (output 1 when inputs differ).
- Minimal SOP: uses two product terms, each with two literals.
- K-map view: Ones at cells (A, B) = (0, 1) and (1, 0) are isolated; each yields one implicant.
- Symmetry: XOR is symmetric in A and B; swapping inputs doesn’t change Y.
- Implementations: Two AND gates feeding an OR, plus two inverters; or a single XOR gate.
- Uses: Parity checking, adders (sum bit), inequality tests, bit toggling.
Knowledge Booster
- Why (a) is wrong: The product contains contradictory literals (), so the whole term is always 0.
- Why (b) is wrong: Also contradictory when multiplied together; it evaluates to 0 for all inputs.
- Why (d) is wrong: That’s XNOR (output 1 when inputs are equal), the complement of XOR, giving 1 for (0, 0) and (1, 1) instead of the required cases.