Gate2017 cs Q12

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

Assume for all inputs (a, b, 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 NOR gates required is _____.

Note – Numerical Type question

Answer
Comment
Array

Option : B
Explanation :
From K-map simplification we get the min-term as CA' . So We can simplify it for NOR gate expression
i.e. C' NOR A = (C'+A)' = CA'
Now complemented inputs are also given to us so for 2 input NOR gate we need only 1 NOR gate.
1 is correct answer

Forgot your password?

I agree with the Terms.