Experiment : 2.

EXPERIMENT 2.1

AIM: To design and verify operation of half adder and full adder.

COMPONENTS REQUIRED: IC 7400, IC 7408, IC 7486, and IC 7432, and IC Trainer Kit.

THEORY:
Half-Adder: A combinational logic circuit that performs the addition of two data bits, A and
B, is called a half-adder. Addition will result in two output bits; one of which is the sum bit, S,
and the other is the carry bit, C. The Boolean functions describing the half-adder are:

S =A XOR B C=A B

Truth table of half adder

CIRCUIT DAIGRAM :

SIMULATION AND SCREENSHOTS

CASE 1 : when input is (1 0 ) then sum is 1 ans carry is 0 , i.e switch A is 1 and B is 0
CASE 2 : when both input is (1 1 ) then sum is 0 carry is 1 , i.e switch A is 1 and B is 1

BRIEF SUMMARY

In half adder

IN case 1 : when one input is 0 and another is one , so their sum will be 1 and
carry is 0

IN CAse 2 ; when both input is 1 , they are making carry 1 and giving sum as 0
Full-Adder: The half-adder does not take the carry bit from its previous stage into account.
This carry bit from its previous stage is called carry-in bit. A combinational logic circuit that
adds two data bits, A and B, and a carry-in bit, Cin, is called a full-adder. The Boolean
functions describing the full-adder are:

S = (x xor y) xor Cin C = xy + Cin (x xor y)

Truth table of Full-adder

Circuit diagram -
SIMULATION AND SCREENSHOTS

BRIEF SUMMARY

In full adder

IN this : when one input is 1 1 1 , so their sum qne carry both will be 1 and 1 .

RESULT:
The truth table of minimized Boolean expression is
verified.