UTpaper

Free mock tests & test series

Question 150Asked in BPSC TRE 2.0 (2023) Computer Science Class 11-12

The minimum number of NAND gates required to implement Boolean function f = x′y + xy′ is

  1. A3
  2. B4
  3. C6
  4. DMore than one of the above
  5. ENone of the above
Show answerHide answer

Correct answer: (B) 4

Explanation

x′y + xy′ is XOR, and XOR needs at least 4 NAND gates. One NAND makes (xy)′, two NANDs combine it with x and with y, and a fourth NAND joins their outputs.

From BPSC TRE 2.0 (2023) Computer Science Class 11-12 — Previous Year Paper

This is question 150 of BPSC TRE 2.0 (2023) Computer Science Class 11-12 — Previous Year Paper. See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.