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

S

Sonali Mishra

🎓 Achiever ⭐ 4.53K Points

📊 Digital Electronics and Logic Design

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

(A) Two
(B) Three
(C) Five
(D) Six

💬 Discuss

✅ Correct Answer: (C) Five

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

393

Total Visits

📽️

1 y ago

Published

🎖️

Sonali Mishra

Publisher

📈

83%

Success Rate