Computer · Digital Electronics
The minimum number of 2-input NAND gates required to implement the Boolean function F(A, B, C) = AB' + BC + AC is (assuming only uncomplemented/normal inputs are available):
- 15
- 23
- 34✓
- 46
Correct answer
4
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Preparing for Computer?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Want more practice questions on Digital Electronics?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer · Digital Electronics