1
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$ ?
2
GATE CSE 2019
Numerical
+2
-0
What is the minimum number of 2-input NOR gates required to implement a 4-variable function function expressed in sum-of-minterms form as
f = Σ(0, 2, 5, 7, 8, 10, 13, 15)?
Assume that all the inputs and their complements are available.
f = Σ(0, 2, 5, 7, 8, 10, 13, 15)?
Assume that all the inputs and their complements are available.
Your input ____
3
GATE CSE 2018
Numerical
+2
-0
Consider the minterm list form of a Boolean function 𝐹 given below. $$F\left( {P,Q,R,S} \right) = $$ $$\sum {m\left( {0,2,5,7,9,11} \right)} $$ $$ + \,\,d\left( {3,8,10,12,14} \right)$$
Here, $$m$$ denotes a minterm and $$d$$ denotes a don’t care term. The number of essential prime implicants of the function $$F$$ is ___________.
Your input ____
4
GATE CSE 2012
MCQ (Single Correct Answer)
+2
-0.6
What is the minimal form of the Karnaugh map shown below? Assume that $$X$$ denotes a don’t care term.

Questions Asked from K Maps (Marks 2)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages