GateAI
Boolean Algebra and Minimization

GATE CSE 2014 Set 3 · Q7

MCQ1 markEasy

Time

Consider the following minterm expression for FF: F(P,Q,R,S)=∑0,2,5,7,8,10,13,15F (P, Q, R, S) = \sum 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 FF is

Select one answerSingle correct

Pick an option to check

Solution

Step-by-step verified solution

Official answer: B) Q S + QS

Boolean Algebra and Minimization

We 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 PQPQ for rows and RSRS for columns:

  • The four corner cells: m0(0000)m_0 (0000), d2(0010)d_2 (0010), d8(1000)d_8 (1000), m10(1010)m_{10} (1010). These 4 cells combine into a single group where Q=0Q = 0 and S=0S = 0, giving the term Q‾S‾\overline{Q}\overline{S}.

  • The four cells: m5(0101)m_5 (0101), d7(0111)d_7 (0111), d13(1101)d_{13} (1101), m15(1111)m_{15} (1111). These 4 cells combine into a group where Q=1Q = 1 and S=1S = 1, giving the term QSQS.

Both groups together cover all the required minterms {0,5,10,15}\{0, 5, 10, 15\}.

Thus, the minimal SOP expression is:

F=Q‾S‾+QSF = \overline{Q}\overline{S} + QS

Therefore, B is the correct option.

Try the question first, then check your work.

Think the official key or this write-up is wrong?

Report error or challenge

Examiner trap

The misconception this question tests

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

Where do you stand for GATE?

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.

One GATE CSE PYQ every morning

An official question by email at 7 AM IST, with a link to its verified solution. Unsubscribe in one click.

Boolean Algebra and Minimization in GATE CSE

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 Minimization

More from GATE CSE 2014 Set 3

Share this solution

A plain-text card for WhatsApp or Telegram study groups.

GateAI solution cardGATE CSE 2014 Set 3 · Q7 · MCQ

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

Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.