Correct option is D
From the truth table: when B = 0, Y = 0; when B = 1, Y = 1, regardless of A.
Thus Y follows B exactly—so Y = B.
Equivalently, in canonical SOP: .
A K-map would also group the two 1s in the B = 1 column, yielding Y = B.
Equivalently, in canonical SOP: .
A K-map would also group the two 1s in the B = 1 column, yielding Y = B.
Algebraically, option (b) simplifies to , which is not B.
Option (a) is , which is impossible to satisfy (requires A = 0 and A = 1 or B = 1 and B = 0 simultaneously), hence always 0.
Option (c) is , also always 0.
Therefore, only (d) matches the truth table behavior.
Option (a) is , which is impossible to satisfy (requires A = 0 and A = 1 or B = 1 and B = 0 simultaneously), hence always 0.
Option (c) is , also always 0.
Therefore, only (d) matches the truth table behavior.
Important Key Points
- Identity behavior: When a truth table shows Y identical to B across all rows, the logic equation is simply Y = B.
- Independence from A: If outputs do not change with A, A is a don’t-care input for the function.
- Simplification check: Use basic identities—, and factoring—to test alternatives quickly.
- Design implication: Implementing Y = B needs just a wire (or buffer), minimizing gates, delay and power.
- Verification tip: Compare column-by-column: if two columns match exactly, they are logically equivalent.
- Robustness: Expressions that simplify to constants (0/1) cannot fit a non-constant truth table; eliminate them first.
Knowledge Booster
- Why (a) is wrong: ; contradicts rows where B = 1 but Y = 1.
- Why (b) is wrong: ; this outputs 1 when B = 0, the opposite of Y = B.
- Why (c) is wrong: , a constant zero function.
- Extra tip: If the truth table equals B, alternative equivalent forms include and ; both reaffirm the identity.