• edited by
11,467 views

4 Answers

Best answer
14 14 votes

Need only 3 NAND Gate : A+B = ((A + B)')' = ( A' .B' )'

• selected by
6 6 votes
  by using NAND by using NOR
NOT 1 1
OR 3 2
AND 2 3
NAND - 4
NOR 4 -
EX-OR 4 5
EX-NOR 5 4

so by using 3 NAND gate we can perform OR gate operation

• edited by
3 3 votes
Gate Min NAND MIn NOR
AND 2 3
OR 3 2
NAND 1 4
NOR 4 1
EX-OR 4 5
EX-NOR 5

4

For NOT gate only 1 NAND & NOR gate are enough to realize.

& IF from 2 Input NAND gate we want to realize n-input NAND gate then it will be 2n-3. 

Answer:
Position:
Show:

Related questions

8 8 votes
1 answers 1 answer
7.4k
7.4k views
sh!va asked May 7, 2017
7,399 views
Estimation at software development effort for organic software in basic COCOMO is:E = 2.0 (KLOC) 1.05 PME = 3.4 (KLOC) 1.06 PME = 2.4 (KLOC) 1.05 PME = 2.4 (KLOC) 1.07...
9 9 votes
5 answers 5 answers
8.9k
8.9k views
go_editor asked Sep 28, 2014
8,890 views
In the context of modular software design, which one of the following combinations is desirable?High cohesion and high couplingHigh cohesion and low couplingLow cohesion ...
64 64 votes
6 answers 6 answers
25.9k
25.9k views
Arjun asked Feb 14, 2017
25,910 views
Consider the Karnaugh map given below, where $X$ represents "don't care" and blank represents $0$.Assume for all inputs $\left ( a,b,c,d \right )$, the respective complem...
9 9 votes
2 answers 2 answers
9.2k
9.2k views
neha singh asked Mar 25, 2016
9,238 views
The minimum number of $\text{NAND}$ gates required to implement the Boolean function $A + A\overline{B} + A\overline{B}C$ is equal to$0$ (Zero)$1$$4$$7$