Which of the following Boolean algebraic equation(s) is/are CORRECT?
Topic-wise GATE CS PYQs with verified steps
GATE CSE 2025 Set 2 · Q50
Time
Select all that applyOne or more correct
Solution
Official answer: B) A B + A C + B C = A B + A C; C) (A + C) ( A + B) = A B + A C; D) (A + B + D) (C + D) ( A + C + D) (A + B + D) = A D + C D
Boolean Algebra and MinimizationLet us verify each option using Boolean algebra rules:
Option (A):
Combine terms:
Using absorption ():
For , , but . Thus, . (Incorrect)
Option (B):
By the Consensus Theorem, is redundant because and are present in and .
Option (C):
By the Consensus Theorem, . (Correct)
Option (D): Let . Combine terms:
(by absorption)
Therefore:
Applying De Morgan's Laws to find the complement:
Therefore, options B, C, and D are correct.
Try the question first, then check your work.
Examiner trap
Use standard Boolean identities, such as the Consensus Theorem , and De Morgan's laws to simplify both sides of each equation.
This Boolean Algebra and Minimization previous year question is Q50 of the GATE CSE 2025 Set 2 paper. Find more GATE CSE PYQs on Boolean Algebra and Minimization in Digital Logic, or browse all GATE CSE PYQs.
Free diagnostic
Take the 20-minute diagnostic: the 3 topics that cost you the most marks, and a rank range. Or sit 5 related Boolean Algebra and Minimization PYQs now with no account.
An official question by email at 7 AM IST, with a link to its verified solution. Unsubscribe in one click.
Boolean Algebra and Minimization has 36 GATE CSE PYQs across 23 papers from 2011 to 2026. 6 of them are 2-mark MSQs like this one, and GATE CSE 2025 Set 2 has 3.
How GATE tests Boolean Algebra and MinimizationIndependent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.