edited by
19,922 views
43 votes
43 votes

What is the minimum number of gates required to implement the Boolean function $\text{(AB+C)}$ if we have to use only $2\text{-input NOR}$ gates?

  1. $2$
  2. $3$
  3. $4$
  4. $5$
edited by

6 Answers

Best answer
90 votes
90 votes

Given boolean function is 

$f = AB + C$

$\quad = (A+C) . (B +C)$ 

$\quad =((A+C)' +(B+C)')'$

Therefore, $3$ NOR gates required .

Correct Answer: $B$

edited by
58 votes
58 votes

Here is a simple approach to these kinds of questions.

 

This can be applied to any questions and you'll get min number of gates always.

Answer:

Related questions

29 votes
29 votes
5 answers
2
Ishrat Jahan asked Nov 1, 2014
11,161 views
What is the minimum number of $\text{NAND}$ gates required to implement a $2\text{-input EXCLUSIVE-OR}$ function without using any other logic gate?$2$$4$$5$$6$
6 votes
6 votes
3 answers
3
GateAspirant999 asked Oct 11, 2016
9,537 views
The truth table for the combinational circuit is shown below:What is the minimum number of two input NAND gates required to realize this logic circuit?
24 votes
24 votes
6 answers
4
Kathleen asked Sep 22, 2014
17,444 views
How many $32K \times 1$ RAM chips are needed to provide a memory capacity of $ 256K$ bytes?$8$$32$$64$$128$