Scribd
Upload
8 views3 pages

Half and Full Adder Circuit Guide

The document outlines the procedure for constructing and verifying half and full adder circuits using logic gates. It includes the necessary components, theory behind half and full adders, and step-by-step instructions for building the circuits on a breadboard. The truth tables for both adders are provided to confirm the expected outputs based on various input combinations.

Uploaded by

mansikulkarni510
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
8 views3 pages

Half and Full Adder Circuit Guide

The document outlines the procedure for constructing and verifying half and full adder circuits using logic gates. It includes the necessary components, theory behind half and full adders, and step-by-step instructions for building the circuits on a breadboard. The truth tables for both adders are provided to confirm the expected outputs based on various input combinations.

Uploaded by

mansikulkarni510
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

1) Make a simple LED circuit

Aim: To realize half/full adder using logic gates and verify their truth tables.
Components Required: IC 7408, IC 7432, IC 7486, LED’s, wires, 5V DC supply and
Breadboard.
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B,
C = AB.
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 = ABCn-1, C = (AB) Cn-1 +AB
Procedure:
1. Verify that the gates are working.
2. Write the proper truth table for the Half adder and draw the logic diagram.
3. Make the connections as per the logic diagram for the half adder circuit, on the
breadboard.
4. Switch on the VCC power supply and apply the various combinations of the inputs
according to the respective truth tables.
5. Note down the output readings for the half adder circuit for the corresponding
combination of inputs.
6. Verify that the outputs are according to the expected results.
7. Repeat the procedure for the full adder circuit.
8. Verify that the sum/difference and carry/borrow bits are according to the expected
values.

Half Adder:
Full Adder:

Truth Table:

INPUT OUTPUTS
A B CIN S (Sum) COUT (Carry)
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

Logic expressions:
Logic Diagram:
Realization of full adder using Basic and EXOR gates

A
1
3
B 2
4 Sum
6
Cin 5

4
6
5
1 Carry
3
2
1
3
2

Result:
Thus the Logic circuit of Full Adder Circuit was constructed and the truth table
was verified.

You might also like