Question

Draw a half-adder using only NAND gates.

Draw a half-adder using only NAND gates.

Engineering   Computer-Science   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

Truth table and expression for half adder

Sum= A XOR B

Carry= A AND B

Below is the truth table:

A B SUM CARRY

0 0 0 0

0 1 1 0

1 0 1 0

1 1 0 1

Implementation of Half adder using only NAND gate

PS: Please leave a comment in case any further assistance needed :)

0 0
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Design Half-adder and Full-adder circuits using truth tables. Use only 2-input NAND gates
Design Half-adder and Full-adder circuits using truth tables. Use only 2-input NAND gates
Design a 1-bit Full adder using one 3-bit majority encoder and a set of NAND gates
Design a 1-bit Full adder using one 3-bit majority encoder and a set of NAND gates
Draw a circuit using only NAND, NOR, and NOT for the combination 0001 that gives you...
Draw a circuit using only NAND, NOR, and NOT for the combination 0001 that gives you a 1 when 0001 is inputted and zero for all other inputs (ex. inputting 0011 will result in 0). The NAND, NOR, and NOT gates can only accept 2 inputs.
how do I convert this SOP expression using only 2-input NAND gates? (use DeMorgan's Law) R...
how do I convert this SOP expression using only 2-input NAND gates? (use DeMorgan's Law) R = A'B'C' + AB'
What might be the purpose of using a full adder (rather than a half adder) for...
What might be the purpose of using a full adder (rather than a half adder) for the first "column" in a parallel adder circuit?
Q/ Design a full adder using 2-input XOR, AND, and OR gates. Show all the steps...
Q/ Design a full adder using 2-input XOR, AND, and OR gates. Show all the steps including the truth table, output expressions/equations, simplifications etc.
Explain how the BJTs are acting as switches to implement the NAND and NOR gates .
Explain how the BJTs are acting as switches to implement the NAND and NOR gates .
Make an 8-bit adder in a logical diagram (Logic gates)
Make an 8-bit adder in a logical diagram (Logic gates)
Implement a full Subracter using a minimum number of gates. Compare the logic equations for the...
Implement a full Subracter using a minimum number of gates. Compare the logic equations for the full adder and full subtracter.
True and False 1. A half-adder has 2 inputs and 2 outputs. 2. Using only full-adders,...
True and False 1. A half-adder has 2 inputs and 2 outputs. 2. Using only full-adders, how many are needed to add together two 8-bit unsigned integer binary codes? 3. When A and B are unsigned integer binary codes, A-B is calculated as 2's complement(A) + B. 4. An N-bit address bus sends an address value one bit at a time. 5. The instruction pointer register stores the result of calculations from the previous instruction.
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT