Official PYQ · 2024Set 2 · Q40Minimization (K-Maps etc.)MSQ2 marks

GATE CS 2024 Set 2 Q40 — Minimization (K-Maps etc.)

Consider $4$ -variable functions $f 1, f 2, f 3, f 4$ expressed in sum-of-minterms form as given below.
$\begin{array}{l} f 1=\sum(0,2,3,5,7,8,11,13) \\ f 2=\sum(1,3,5,7,11,13,15) \\ f 3=\sum(0,1,4,11) \\ f 4=\sum(0,2,6,13) \end{array}$

With respect to the circuit given above, which of the following options is/are CORRECT?

View answer

Answer: C;D

Worked explanation not available yet.

Free practice · Your answers on this page are not saved.

Published 10 Oct 2026

Report a correction

GATE CS · 2026Minimization (K-Maps etc.)
Consider a Boolean function $F$ with the following minterm expression: $F(P, Q, R, S)=\sum 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$ ?
MSQ · 2 marks
GATE CS · 2026Minimization (K-Maps etc.)
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, ${\cdot}$ is AND operation, ${\prime}$ is NOT operation
MCQ · 2 marks
GATE CS · 2025Minimization (K-Maps etc.)
Consider the following four variable Boolean function in sum-of-product form $F\left(b_{3}, b_{2}, b_{1}, b_{0}\right)=\sum(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. …
MCQ · 2 marks
GATE CS · 2025Minimization (K-Maps etc.)
Given the following Karnaugh Map for a Boolean function $F(w, x, y, z)$ : Which one or more of the following Boolean expression(s) represent(s) $F$ ?
MSQ · 2 marks
GATE CS · 2024Minimization (K-Maps etc.)
Consider a Boolean expression given by $\text{F(X, Y, Z)}=\sum(3,5,6,7)$ . Which of the following statements is/are CORRECT?
MSQ · 2 marks
GATE CS · 2018Minimization (K-Maps etc.)
Consider the minterm list form of a Boolean function $F$ given below. $F(P, Q, R, S) = \Sigma m(0, 2, 5, 7, 9, 11) + d(3, 8, 10, 12, 14)$ Here, $m$ denotes a minterm and $d$ denotes a don't care term. The number of essential prime implicants of the function $F$ is ___
NAT · 2 marks

Browse this topic

More Minimization (K-Maps etc.) questions

GATE CS 2024 Set 2 Q40 — Minimization (K-Maps etc.)

Related questions