Professional Documents
Culture Documents
20BCS4357 Exp3
20BCS4357 Exp3
AIM
To design and verify operation of half adder and full adder.
REQUIREMENTS
IC 7408 (AND gate ) , IC 7486 (XOR gate) , IC 7432( OR gate) , Power supply , LED, resistor
and breadboard .
THEORY
DE LAB WORKSHEET
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:
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:
SUM= A XOR B XOR C CARRY = AB+ (A XOR B)C
DE LAB WORKSHEET
HALF- ADDER
DE LAB WORKSHEET
TRUTHTABLE-
FULL- ADDER
DE LAB WORKSHEET
TRUTHTABLE
PROCEDURE:
● Check the components for their working
● Insert the appropriate IC in to the IC base ● Make
connections as shown in the circuit diagram.
● Verify the Truth Table and observe the outputs.
SIMULATION RESULTS:
FOR HALF ADDER
1.A=1 and B=1 ; CARRY =1 (HIGH)
DE LAB WORKSHEET
RESULT:
The truth table of minimized Boolean expression is verified.
LEARNING/ OBSERVATION
In this experiment, we observe that truth table is verified by use of switches.
TROUBLESHOOTING
No troubleshoot is occurred during the verification.
DE LAB WORKSHEET