Q61NEET UG 2022MCQ
The truth table for the given logic circuit is
📖 Explanation
Boolean algebra simplification relies on fundamental identities like De Morgan's laws and the complementarity property to reduce complex logic circuits into their simplest equivalent forms. Analyzing the circuit yields the initial expression C=(A⋅B)⋅(A⋅B). Applying De Morgan's theorem combines the terms under a single overarching negation to give C=A⋅B+A⋅B. Factoring out the common variable B transforms this into C=(A+A)⋅B, and since the complementarity law establishes that A+A=1, the expression ultimately simplifies down to C=B. This final output depends exclusively on input B, producing a truth table where C simply inverts the values of B regardless of the state of A.