What is the minimum number of gates required to implement the Boolean function…
What is the minimum number of gates required to implement the Boolean function (AB+C) if we have to use only 2-input NOR gates?
Answer: 3 — AB + C = (A+C) (B+C) = ((A+C)’ + (B+C)’)’ So, ‘3’ 2-input NOR gates are required.
Attempted by 116 students.
Show answer & explanation
Correct answer: 3
AB + C = (A+C) (B+C) = ((A+C)’ + (B+C)’)’
So, ‘3’ 2-input NOR gates are required.
A video solution is available for this question — log in and enroll to watch it.
Loading lesson…