Logic Gates
The truth table for the given logic circuit is
![]()
Show answer and solution
Answer: (a)
- Upper gate is NOR: . Lower gate is AND: . Final gate is NAND.
- .
- and can never both be 1, so their product is always 0 and for all inputs.
- Table P has Y = 1 in every row, so the answer is (a) P.