As this is obviously a homework problem, I won't answer it.
However I will give you couple of hints. First figure out how to make an exclusive-or gate from nand gates. The rest is trivial. Using a Karnaugh map will make it much simpler to design than using an ordinary truth table.
You cannot design a full adder using only OR gates. You also need AND gates. Typically, this can be done with just 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.
12 NOR gates are required to implement full adder
Check this link http://www.dumpt.com/img/viewer.php?file=bd6b3mqsa66fhr6c76l1.bmp
by the procedure design a half subtractor design a logic ciruit to add two numbers with five bits each drawthe logic diagram of afull adder using using NAND gates only ?
Boolean
two nand gates
universal gates are the ones from which we can design other gates also. for eg. NAND and NOR gates. they help in forming the uniformity in the circuits.
by multiplying two NAND gates
ans. 3 nand gates resoon :- OR GATE :- x+y NAND GATE :- x'+y' LOGIC :-so the logic is is we apply NAND to the inputs x' and y' instead of xand y we would get x+y DESIGN PROCEDURE 1. for inverting the input x and y can be done by NAND gates , 2. take a NAND gate and pass both x in both the inputs it means x NAND x gives you x' 3. follow similar procedure for inverting y 4. and then all the outputs of those NAND gates as the inputs of another NAND gate
Four.
The XOR operation can be implemented using only NAND gates by combining multiple NAND gates in a specific arrangement to achieve the desired XOR functionality.