Consider the Karnaugh map given below, where X represents “ don’t care” and blank represents 0.
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.
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
Attention reader! Don’t stop learning now. Learn all GATE CS concepts with Free Live Classes on our youtube channel.