This is a term from digital electronis referring to a Negated AND or NOT AND gate. A NAND gate is a logic gate that produces an output which is false only if all its inputs are true. Boolean functions are activated by use of NAND gates.
9,to implement a half adder 5 nand gates and for a full adder,another xor gate is required consisting of 4 nand gates. thus a total of 9 nand gates are required for a full adder.
yes (a or b)' = a' and b' a or b = (a' and b')' a or b = a' nand b'
Check this link http://www.dumpt.com/img/viewer.php?file=bd6b3mqsa66fhr6c76l1.bmp
To make a full subtractor, you need an XOR and a NAND gate.
XORing X with 1 gives X', i.e., NOT(X). If we are able to construct a NAND (AND) using XOR, we can also obtain AND (NAND) from it, which makes XOR a universal gate since inverted inputs to a NAND (AND) will give OR (NOR). However XOR is not a universal gate! Therefore we cannot obtain NAND (AND) using XOR. :-) By, Tirtha Sarathi Ghosh Class 10 IIT Kanpur Aspirant
Not And (electronic logic gate)
74ls00 is the ic no. Of nand gate
Gyani Nand was born in 1943.
nand gate
the not gate applied to and gate is nand gate
12 NOR gates are required to implement full adder
Four.