What is a full adder truth table

A full adder truth table displays all possible input combinations and their corresponding outputs for a full adder circuit, which adds three binary inputs (two data bits plus a carry-in bit) and produces two outputs (a sum bit and a carry-out bit). The truth table has eight rows representing all possible combinations of the three inputs (000, 001, 010, 011, 100, 101, 110, 111), with columns showing the resulting sum and carry-out for each combination.

The full adder truth table is: when inputs A, B, and Carry-in are (0,0,0) → Sum=0, Carry-out=0; (0,0,1) → Sum=1, Carry=0; (0,1,0) → Sum=1, Carry=0; (0,1,1) → Sum=0, Carry=1; (1,0,0) → Sum=1, Carry=0; (1,0,1) → Sum=0, Carry=1; (1,1,0) → Sum=0, Carry=1; (1,1,1) → Sum=1, Carry=1. The pattern shows that Sum equals 1 when an odd number of inputs are 1 (Sum = A XOR B XOR Carry-in), and Carry-out equals 1 when at least two inputs are 1 (Carry-out = (A AND B) OR (B AND Carry-in) OR (A AND Carry-in)). This truth table is fundamental to digital design because full adders are the building blocks of all arithmetic circuits in computers. By understanding this truth table, you can see how binary addition works at the hardware level—each bit position in a multi-bit addition uses a full adder, with carries connecting adjacent positions. Computer engineering students memorize this truth table because it represents one of the most basic yet essential operations in computing, forming the foundation for more complex arithmetic operations like subtraction (using two's complement), multiplication (repeated addition), and division.