The GATE Grind

GATE 2025 CS (CS2) – Question 43

Digital Logic · Boolean Algebra and Minimization · 2 marks · Multiple select

Given the following Karnaugh Map for a Boolean function $F(w,x,y,z)$ (rows $wx$ = 00, 01, 11, 10; columns $yz$ = 00, 01, 11, 10):

$wx \backslash yz$00011110
001001
010110
110110
101001

Which one or more of the following Boolean expression(s) represent(s) $F$?

  1. $\bar{w}\bar{x}\bar{y}\bar{z} + w\bar{x}\bar{y}\bar{z} + \bar{w}\bar{x}y\bar{z} + w\bar{x}y\bar{z} + xz$
  2. $\bar{w}\bar{x}\bar{y}\bar{z} + \bar{w}\bar{x}y\bar{z} + w\bar{x}yz + xz$
  3. $\bar{w}\bar{x}\bar{y}\bar{z} + w\bar{x}\bar{y}\bar{z} + w\bar{x}\bar{y}z + xz$
  4. $\bar{x}\bar{z} + xz$

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (A) $\bar{w}\bar{x}\bar{y}\bar{z} + w\bar{x}\bar{y}\bar{z} + \bar{w}\bar{x}y\bar{z} + w\bar{x}y\bar{z} + xz$; (D) $\bar{x}\bar{z} + xz$

Explanation

Reading the K-map ($wx$ rows, $yz$ columns), the 1's are at cells:
$m_0,m_2,m_8,m_{10}$ (the four corners, where $x=0$ and $z=0$) and $m_5,m_7,m_{13},m_{15}$ (the middle block, where $x=1$ and $z=1$).

So $F=\bar x\bar z+xz$ (option D).

**Option A.** $\bar w\bar x\bar y\bar z+w\bar x\bar y\bar z+\bar w\bar xy\bar z+w\bar xy\bar z$ are the minterms $0,8,2,10$, which together equal $\bar x\bar z$. Adding $xz$ gives $F$. Equal.

**Option B.** It contains $w\bar xyz=m_{11}$, which is 0 in $F$. Not equal.

**Option C.** It contains $w\bar x\bar yz=m_9$, which is 0 in $F$. Not equal.

Answer: A, D.

More Boolean Algebra and Minimization questions

All Boolean Algebra and Minimization questions →