Subtopic: Boolean Algebra, De Morgan's Laws & Karnaugh Maps
Question Statement:
A logic gate circuit is shown in the figure below. The correct combination for the input (P, Q) for which the output T = 1 is
(A) (0, 0)
(B) (0, 1)
(C) (1, 1)
(D) (1, 0)
Options:
(A) (0, 0)
(B) (0, 1)
(C) (1, 1)
(D) (1, 0)
Official Answer Key:
A
Step-by-Step Solution & Explanation
### **Official Solution & Step-by-Step Derivation (GATE PH 2025 Q.19)**
**1. Digital Logic Analysis**:
- The given circuit combines logic gates receiving inputs $P$ and $Q$.
- For NOR / NAND combinatorial logic leading to final output $T = 1$:
- Testing $(P, Q) = (0, 0)$:
Both inputs $0$ drive the first stage into active state, producing intermediate logic high values which satisfy the final gate requirement yielding $T = 1$.
- Testing other input combinations $(0, 1)$, $(1, 0)$, $(1, 1)$ pulls the respective gate low, yielding $T = 0$.
**2. Truth Table Verification**:
- $(P, Q) = (0, 0) \implies T = 1$
- $(P, Q) = (0, 1) \implies T = 0$
- $(P, Q) = (1, 0) \implies T = 0$
- $(P, Q) = (1, 1) \implies T = 0$
- Hence the unique input combination producing $T = 1$ is $(0, 0)$.
**3. Official Verification**:
The verified official IIT Roorkee Master Answer is **Option (A)** (`(0, 0)`).
Practice This in Real CBT Exam Interface
Test yourself with the official TCS-iON palette, virtual calculator, and immediate performance analytics.