The cooperative circuit that completes the addition is called the adder circuit.
All the mathematical work of a computer is done by adding binary. Multiplication is revised addition, and division is subtraction. Again, in the complementary method, subtraction can be done only through binary addition. So being able to add means being able to multiply, subtract and divide.
Adder circuits are two types-
1. Half Adder Circuit or Half Add Circuit
2. Full Adder Circuit or full addition circuit.
Half-Adder Circuit: A cooperative circuit that adds two bits and gives a sum (S) and a carry (C) output are called a half-added circuit.
Half adder can add two bits. So four different types of input sets can be created with two bits.
Full adder circuit: A cooperative circuit that adds three binary bits (two input bits and a carry bit) and gives a sum (S) and current carry (C) output is called a full add circuit or full addition circuit. A full adder circuit is used to add the other two bits, including the carry.
Again a full adder can be worked by two half adder circuits. The full adder can add three bits. So eight different types of input sets can be created with three bits.