1
GATE CSE 2026 Set 2
MCQ (Single Correct Answer)
+2
-0

Consider the following 4-variable Boolean function

$$ F(A, B, C, D)=\Sigma m(0,1,2,3,8,9,10,11) $$

Consider $A$ as MSB, $D$ as LSB. Which one of the following options represents the minimal sum of products form for the above function?

Note: + is OR operation, • is AND operation, ' is NOT operation

A

$A^{\prime}+B^{\prime}+C^{\prime}+D^{\prime}$

B

$B^{\prime}$

C

$A^{\prime} \cdot B^{\prime}+A \cdot B$

D

$A^{\prime}$

2
GATE CSE 2026 Set 1
MCQ (More than One Correct Answer)
+2
-0

Consider a Boolean function $F$ with the following minterm expression:

$$ F(P, Q, R, S)=\Sigma m(1,2,3,4,5,7,10,12,13,14) $$

Which of the following options is/are the minimal sum-of-products expression(s) of $F$ ?

A

$\bar{P} S+Q \bar{R}+\bar{P} \bar{Q} R+\bar{Q} R \bar{S}$

B

$\bar{P} S+Q \bar{R}+\bar{P} \bar{Q} R+P R \bar{S}$

C

$\bar{P} S+Q \bar{R}+P Q \bar{S}+P R \bar{S}$

D

$\bar{P} S+Q \bar{R}+P Q \bar{S}+\bar{Q} R \bar{S}$

3
GATE CSE 2025 Set 2
MCQ (More than One Correct Answer)
+2
-0

Given the Following Karnaugh Map for a Boolean function $F(w,x,y,z)$:

GATE CSE 2025 Set 2 Digital Logic - K Maps Question 3 English

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

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}+x z$
B
$\bar{w} \bar{x} \bar{y} \bar{z}+\bar{w} \bar{x} y \bar{z}+w \bar{x} y z+x z$
C
$\bar{w} \bar{x} \bar{y} \bar{z}+w \bar{x} \bar{y} \bar{z}+w \bar{x} \bar{y} z+x z$
D
$\bar{x} \bar{z}+x z$
4
GATE CSE 2025 Set 1
MCQ (Single Correct Answer)
+2
-0

Consider the following four variable Boolean function in sum-of-product form

$$F\left(b_3, b_2, b_1, b_0\right)=\Sigma(0,2,4,8,10,11,12)$$

where the value of the function is computed by considering $b_3 b_2 b_1 b_0$ as a 4-bit binary number, where $b_3$ denotes the most significant bit and $b_0$ denotes the least significant bit. Note that there are no don't care terms. Which ONE of the following options is the CORRECT minimized Boolean expression for $F$ ?

A
$\bar{b}_1 \bar{b}_0+\bar{b}_2 \bar{b}_0+b_1 \bar{b}_2 b_3$
B
$\bar{b}_1 \bar{b}_0+\bar{b}_2 \bar{b}_0$
C
$\bar{b}_2 \bar{b}_0+b_1 b_2 b_3$
D
$\bar{b}_0 \bar{b}_2+\bar{b}_3$

GATE CSE Subjects

Browse all chapters by subject

Software Engineering
Web Technologies