DLD(SP25)_LabReport1_223014025
DLD(SP25)_LabReport1_223014025
Spring 2025
Section - 02
Room No - PB 104
Problem Description
An adder or summer is a combinational circuit that adds binary numbers. There are mainly
two kinds of adders, half adder and full adder. The half adder can add only two single bits of
binary digit and outputs the sum of the bits and a carry which is the overflow of the sum. A
full adder can add two single bit digits and one carry bit which is the overflow of the sum of
the previous stage of addition and outputs the sum and the carry.
Problem Solution
1) Specification
0 0 0 0
0 1 1 0
1 0 1 0
1 1 0 1
Full Adder Truth Table:
0 0 0 0 0
0 0 1 1 0
0 1 0 1 0
0 1 1 0 1
1 0 0 1 0
1 0 1 0 1
1 1 0 0 1
1 1 1 1 1
3) Expression Formulation
Half Adder:
Carry (C) = x · y
Sum (S) = x ⊕ y (XOR operation)
Full Adder: