Solution
Related Formula
De Morgan's Laws: A · B = A + BCore Logic
Let's trace the logic line by line. Top branch: A passes through an AND gate with both inputs tied to A, so it remains A. Bottom branch: A and B pass through a NAND gate, yielding A · B. Then it passes through an AND gate with inputs tied together, so it remains A · B.
Step 1: Boolean Expression
Finally, the inputs A and A · B are fed into a final AND gate.
Y = A · A · BApplying De Morgan's Law:
Y = A · ( A + B) Y = A · A + A · BStep 2: Simplify
Since A · A = 0, we have:
Y = 0 + A B = A BChecking values: If A=1, B=0, then Y = 1 · 1 = 1. For all other combinations, Y = 0.
Pattern Recognition
An AND gate acting on A and NAND(A, B) inherently acts as a "strictly A and NOT B" checker. The boolean algebra instantly simplifies A( AB) to A B.
Chapter Mix
Class 12 Physics: Semiconductor Electronics