A 2-bit full adder is a combinational logic circuit that adds two 2-bit binary numbers, producing a 2-bit sum output and a carry-out bit that can be chained with other adders for multi-bit operations. Its truth table serves as the definitive reference for understanding how each input combination translates to a sum and carry result, making it a cornerstone concept in digital electronics and computer architecture. Whether you are a student designing your first arithmetic circuit or an engineer optimizing a processor's ALU, mastering the truth table for a 2-bit full adder provides the foundation for grasping larger binary addition systems.
Introduction
Before diving into the specifics of a 2-bit implementation, it helps to recall what a single-bit full adder does. A full adder takes three inputs: two significant bits (A and B) and a carry-in (Cin) from a previous lower-order stage. It produces two outputs: a sum (S) and a carry-out (Cout). The logic is governed by XOR, AND, and OR gates, and its truth table contains eight rows because there are