Consider the following Boolean expression for F: F(P, Q, R, S) = PQ + PQR + PQ RS The minimal sum-of-products form of F is
Topic-wise GATE CS PYQs with verified steps
GATE CSE 2014 Set 1 · Q7
Time
Select one answerSingle correct
Solution
Official answer: A) PQ + QR + QS
Boolean Algebra and MinimizationFactor out from the expression:
Using the Boolean absorption/simplification rule :
Substituting these back:
Now, multiply by :
This gives the minimal sum-of-products expression, matching option A.
Try the question first, then check your work.
Examiner trap
Factor out and apply the identity repeatedly.
This Boolean Algebra and Minimization previous year question is Q7 of the GATE CSE 2014 Set 1 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. 13 of them are 1-mark MCQs like this one, and it is the only one in GATE CSE 2014 Set 1.
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.