1. The full adder is usually a component in a cascade of adders, which add 8, 16, 32, etc. bit binary numbers. The circuit produces a _______________

2. A full adder is a logical circuit that performs an addition operation on three one-bit binary numbers. The full adder produces a sum of the three inputs and carry value

3. A full adder can be combined with other full adders or work on its own.

4. The main difference between a half-adder and a full-adder is that the full-adder has __________________________

5. Full adder: The first two inputs are A and B and the third input is an input carry that is sometimes designated as CIN

6. In the following truth table for a full adder, the CIN and COUT stand for:

7. Analyse the following diagram for a full adder. We can see that the output S is an _____ between the input A and the half-adder SUM output with B and CIN inputs

8. Looking at the circuit diagram, COUT will only be true if any of the two inputs out of the three are LOW.

9. Read the excerpt on full adders below and fill in the blanks

10. We want to be able to add two single bit numbers and also an incoming carry bit. In other words we effectively want to add ____________________

11. For three binary bits there are ______ possible combinations

12. Combining two half adders will produce a full adder without the need for any additional circuitry

13. The full adder is able to add three 1 bit numbers, the third bit is usually the ______________________

14. Full adders can be ____________ to allow two numbers of any bit length to be added

15. Coders can make sure their code is monitoring the __________ in case their calculations are out of range.