Correct AnswerC. Using Boolean algebra
Quick Explanation
Boolean algebra provides identities such as absorption, De Morgan’s laws and distributive rules that systematically reduce a logic expression and therefore the required gate count. Truth tables verify equivalence, but they are not the primary algebraic reduction method.
Detailed Explanation
Concept & Reasoning
Digital circuits can often implement the same Boolean function with fewer gates, fewer inputs and smaller propagation delay. Symbolic Boolean manipulation is a formal way to obtain an equivalent simplified expression. Karnaugh maps are another common graphical method, but among the listed options Boolean algebra is the standard answer.
How to Solve It in the Exam
Look for 'systematic reduction of logic circuits' → Boolean algebra / K-map.
Important Exam PointAfter simplification, a truth table can be used as an independent equivalence check.
Related Revision Path
This question sits in the revision path Digital Electronics → Boolean Algebra → Logic Simplification .
