GATE CSE 2019 | K Maps Question 1 | Digital Logic

GATE CSE 2019

Numerical

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

Your input ____

GATE CSE 2018

Numerical

-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 ____

GATE CSE 2012

MCQ (Single Correct Answer)

-0.6

What is the minimal form of the Karnaugh map shown below? Assume that $$X$$ denotes a don’t care term. GATE CSE 2012 Digital Logic - K Maps Question 4 English

GATE CSE 2012 Digital Logic - K Maps Question 4 English

$$\overline {bd} $$

$$\overline {bd} + \overline {bc} $$

$$\overline {bd} + a\overline {bc} d$$

$$\overline {bd} + \overline {bc} + \overline {cd} $$

GATE CSE 2004

MCQ (Single Correct Answer)

-0.6

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$$. what are the connections required to realize the $$2-$$variable Boolean function $$f=T+R$$ without using any additional Hardware?

$$R$$ to $$X,$$ $$1$$ to $$Y,$$ $$T$$ to $$Z$$

$$T$$ to $$X,$$ $$R$$ to $$Y,$$ $$T$$ to $$Z$$

$$T$$ to $$X,$$ $$R$$ to $$X,$$ $$O$$ to $$Z$$

$$R$$ to $$X,$$ $$O$$ to $$Y,$$ $$T$$ to $$Z$$