Consider the following minterm expression for F: F (P, Q, R, S) = Σ 0, 2, 5, 7, 8, 10, 13, 15 The minterms 2, 7, 8 and 13 are 'do not care' terms. The minimal sum-of-products form for F is
Topic-wise GATE CS PYQs with verified steps
GATE CSE 2014 Set 3 · Q7
Time
Select one answerSingle correct
Solution
Official answer: B) Q S + QS
Boolean Algebra and MinimizationWe are given:
True minterms: $m(0, 5, 10, 15)$
Don't care minterms: $d(2, 7, 8, 13)$
Plotting these on a 4-variable Karnaugh Map with variables for rows and for columns:
The four corner cells: , , , . These 4 cells combine into a single group where and , giving the term .
The four cells: , , , . These 4 cells combine into a group where and , giving the term .
Both groups together cover all the required minterms .
Thus, the minimal SOP expression is:
Therefore, B is the correct option.
Try the question first, then check your work.
Examiner trap
Place the minterms and don't-care conditions on a 4-variable K-map. Look for groups of 4 cells, particularly the 4 corners.
This Boolean Algebra and Minimization previous year question is Q7 of the GATE CSE 2014 Set 3 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 GATE CSE 2014 Set 3 has 2.
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.