# K Maps · Digital Logic · GATE CSE

Start Practice## Marks 1

GATE CSE 2014 Set 3

Consider the following interm expression of $$F:$$
$$F\left( {P,\,Q,\,R,\,S} \right) = \sum {0,2,5,7,8,10,13,15} $$
The minterms $$2, 7, 8$$ and $$1...

GATE CSE 2008

In the Karnaugh map shown below, $$X$$ denotes a don’t care term. What is the minimal form of the function represented by the Karnaugh map?
...

GATE CSE 2002

Minimum $$SOP$$ for $$f(w, x, y, z)$$ shown in karnaugh $$-$$ map below is
...

GATE CSE 2001

Given the following Karnaugh map, which one of the following represents the minimal Sum-Of-Products of the map?
...

GATE CSE 1999

Which of the following functions implements the Karnaugh map shown below?
...

## Marks 2

GATE CSE 2019

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,...

GATE CSE 2018

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)} $$ $$ + ...

GATE CSE 2012

What is the minimal form of the Karnaugh map shown below? Assume that $$X$$ denotes a don’t care term.
...

GATE CSE 2004

Consider a multiplexer with $$X$$ and $$Y$$ as data inputs and $$Z$$ as control input. If $$z=0$$ select input $$x,$$ and $$z=1$$ selects input $$Y$$....

GATE CSE 2003

The literal count of a Boolean expression is the sum of the number of times each literal appears in the expression. For example, the literal count of ...

GATE CSE 2000

Which function does NOT implement the Karnaugh map given below?
...

GATE CSE 1996

What is the equivalent Boolean expression in product-of-sums form for the Karnaugh map given in fig?
...