The minimum number of 2-input NAND gates required to implement the Boolean function $Z = A ¯ B C,$ assuming that A, B and C are available, is

Six

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Five

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

Three

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Two

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is B Five
Five

Suggest Corrections

Similar questions

f = (¯ ¯¯ ¯ A + ¯ ¯¯ ¯ B) (C + D)

4 \times 1

F = (¯ X + ¯ Y) (Z + W)

Y = A B + C D

Join BYJU'S Learning Program