The correct truth table for the given input data of the following logic gate is:

- A
- B
- C
- D
The correct truth table for the given input data of the following logic gate is:

Correct answer:D
Standard Method
Given: The circuit has inputs . Inputs and pass through an AND gate followed by a NOT gate, while inputs and pass through an OR gate. These two outputs then enter an AND gate followed by a NOT gate.
Find: The correct truth table for output .
Step 1: Identify individual logic operations.
From the given circuit, the upper branch gives NAND of and , so its output is . The lower branch gives OR of and , so its output is .
Step 2: Write the Boolean expression.
The final gate is an AND followed by NOT, therefore
Using De Morgan's theorem,
Step 3: Evaluate the given rows.
Checking the listed input combinations row-wise, the resulting output values match the truth table shown in option D.
Conclude: The correct option is D.
Boolean Simplification Trick
Given: The circuit is a combination of NAND, OR, and final NAND stages.
Find: Which option matches the truth table.
A quick approach is to simplify the circuit before checking rows. First write
Now apply De Morgan's theorem directly:
This works because the complement of a product becomes the sum of complements.
Now compare this simplified form with the rows in the options instead of tracing the entire circuit gate by gate each time. The matching table is option D.
Therefore, the correct option is D.
Treating the first branch as instead of is incorrect because the AND gate is followed by a NOT gate. Always include the inversion after identifying the gate output.
Ignoring the final NOT gate leads to using directly as output. This is wrong because the last stage is a NAND operation. First form the AND output, then complement it.
Applying De Morgan's theorem incorrectly to can produce a wrong expression. The correct simplification is , not a product form.
Get unlimited AI-adaptive practice, mastery tracking, and an AI tutor that explains every step — free to start.