GateAI
Boolean Algebra and Minimization

GATE CSE 2017 Set 2 · Q28

MCQ2 marksMedium

Time

Given f(w,x,y,z)=∑m(0,1,2,3,7,8,10)+∑d(5,6,11,15)f(w, x, y, z) = \sum_m(0,1,2,3,7,8,10) + \sum_d(5,6,11,15), where dd represents the *don't-care* condition in Karnaugh maps. Which of the following is a minimum product-of-sums (POS) form of f(w,x,y,z)f(w, x, y, z)?

Select one answerSingle correct

Pick an option to check

Solution

Step-by-step verified solution

Official answer: A) f = ( w + z)( x + z)

Boolean Algebra and Minimization

To obtain the minimum Product-of-Sums (POS) form of f(w,x,y,z)f(w, x, y, z), we find the simplified Sum-of-Products (SOP) expression for the complement function fˉ\bar{f} by grouping the zeros (maxterms) and don't-care terms, and then take the complement.

  1. Identify the zeros of ff: The complete set of 4-variable minterms is {0,1,…,15}\{0, 1, \dots, 15\}.

    • Minterms of ff: {0,1,2,3,7,8,10}\{0, 1, 2, 3, 7, 8, 10\}

    • Don't-cares (dd): {5,6,11,15}\{5, 6, 11, 15\}

    • Zeros of ff (where f=0f=0): {4,9,12,13,14}\{4, 9, 12, 13, 14\}

  2. Group the zeros on a 4-variable K-map for fˉ\bar{f}:

    • Quad 1: Cells (4,6,12,14)(4, 6, 12, 14) with zeros at 4,12,144, 12, 14 and don't-care at 66. This gives the term: xzˉx\bar{z}.

    • Quad 2: Cells (9,11,13,15)(9, 11, 13, 15) with zeros at 9,139, 13 and don't-cares at 11,1511, 15. This gives the term: wzwz.

  3. Form fˉ\bar{f} and complement to find ff:

    fˉ=wz+xzˉ\bar{f} = wz + x\bar{z}

    Taking the Boolean complement using De Morgan's laws:

    f=wz+xzˉ‾=(wˉ+zˉ)(xˉ+z)f = \overline{wz + x\bar{z}} = (\bar{w} + \bar{z})(\bar{x} + z)

Therefore, the minimal POS expression is (wˉ+zˉ)(xˉ+z)(\bar{w} + \bar{z})(\bar{x} + z), which corresponds to Option (A).

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 Q28 of the GATE CSE 2017 Set 2 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. 9 of them are 2-mark MCQs like this one, and GATE CSE 2017 Set 2 has 2.

How GATE tests Boolean Algebra and Minimization

More from GATE CSE 2017 Set 2

Share this solution

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

GateAI solution cardGATE CSE 2017 Set 2 · Q28 · MCQ

Given f(w, x, y, z) = Σm(0,1,2,3,7,8,10) + Σd(5,6,11,15), where d represents the *don't-care* condition in Karnaugh maps. Which of the following is a minimum product-of-sums (POS) form of f(w, x, y, z)?

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.