Practice Full Adder (4.2.2) - Fundamental of Digital Computer - Computer Organisation and Architecture

Practise this section

8 questions

Flashcard drill
4 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
2 questions · about 1 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What is the function of a full adder?
Show hintHide hint
Think about adding numbers in decimal.
Question 2.
How many inputs does a full adder take?
Show hintHide hint
Consider bits being added together.
3Question 3.
What does a full adder add?
- Two binary bits
- Three binary bits
- Three binary bits with a limit
Show hintHide hint
Think of digit sums.
4Question 4.
True or False: The carry-out is zero if the sum does not exceed 1.
- True
- False
Show hintHide hint
Consider the limit of binary addition.
Question 5.
Develop a logic circuit using NAND gates to replicate the function of a full adder.
Show hintHide hint
You can combine NAND operations through De Morgan's Theorems.
Question 6.
Calculate the total propagation delay for an 8 bit full adder given each full adder has a propagation delay of 2 nanoseconds.
Show hintHide hint
Consider how delays stack up with each bit added.

4 more questions in this section. Enroll free to practise them all.