Solution
Related Formula
The Boolean algebraic relationships for standard gates are:
- AND Gate: Y = A · B
- NOT Gate: Y = A
- OR Gate: Y = A + B
Core Logic
Analyzing the connections of the logic circuit shown in the diagram:
- Input A is passed directly to the top AND gate.
- Input A is also passed through a NOT gate, giving A, which is supplied to the bottom AND gate.
- Input B is connected directly to both the top and bottom AND gates.
- Output of the top AND gate is: A · B
- Output of the bottom AND gate is: A · B
Hence:
Both outputs are then combined by an OR gate to give the final output Y:
Step 1: Simplify the Boolean Expression
Using Boolean algebra, factor out B:
Y = (A + A) · BSince A + A = 1:
Y = 1 · B
Y = B
Step 2: Construct the Truth Table
Because the output Y is functionally identical to B, the truth table columns for B and Y must be exactly the same:
- When B = 0, Y = 0
- When B = 1, Y = 1
This yields the matching truth table in Option 2.
Pattern Recognition
Observe: Y = A · B + A · B. Whenever B is a common factor to both paths of the AND-OR configuration, it suggests the expression can be simplified directly to B because the state of A becomes irrelevant (A + A = 1).
Chapter Mix
Class 12 Physics: Semiconductors