GATE | GATE-CS-2017 (Set 1) | Question 28

Consider the Karnaugh map given below, where X represents “ don’t care” and blank represents 0.

g_set1_q18

Assume for all inputs (a, c, d) the respective complements (a’, b’, c’, d’)are also available. The above logic is implemented 2-input NOR gates only.
The minimum number of gates required is ____________.



Note: This questions appeared as Numerical Answer Type.
(A) 1
(B) 2
(C) 3
(D) 4


Answer: (A)

Explanation: g_set1_q18
Solving the above k- map,
F(a,b,c,d)=a’c (x implies don’t care and only one don’t care is needed.)
= ((a’c)’)’ = (a + c’)’
Since complement of variables are also available. So, this can be implemented using one NOR gate.

Therefore, option A is correct

 

Quiz of this Question



My Personal Notes arrow_drop_up

Improved By : PathakD