0% found this document useful (0 votes)
70 views11 pages

DCSD Exp2

Uploaded by

karanmjangid
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
70 views11 pages

DCSD Exp2

Uploaded by

karanmjangid
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 11

Experiment No.

-2
Date of Performance:
Date of Submission:
Circuit Implementation/Program
Execution/ formation/ Timely
Viva Experiment
correction/ Submission Sign with Date
Answers Total
ethical practices

(06) (01) (03) (10)

Experiment No. 2

2.1 Aim: Design of Half Adder & Full Adder Circuit using Logic Gates.

2.2 Course Outcome: Demonstrate an understanding of the logic gates and implement
combinational circuits.

2.3 Learning Objectives: To understand the fundamentals of combinational circuits.

2.4 Requirement: Trainer kit, IC 7486, IC 7432, IC 7408, Connecting wires.

2.5 Related Theory:

Adder circuit is a combinational digital circuit that is used for adding two numbers. A
typical adder circuit produces a sum bit (denoted by S) and a carry bit (denoted by C) as the
output. Adder circuits can be used for a lot of other applications in digital electronics like
address decoding, table index calculation etc.
Adder circuits are of two types: Half adder and Full adder

HALF ADDER
A half adder is a combinational circuit that performs the sum of two binary digits (A, B) to
give a maximum of two binary outputs namely the sum(S) and the carry(C).
Truth table of the Half-Adder is given below

The Boolean expression for the sum (S) and carry(C) of half adder is,
SUM = AB' + A'B = AB
CARRY= A.B

FULL ADDER
A full adder is a combinational circuit that performs the sum of three binary digits (A, B, Cin) to give a
maximum of two binary outputs namely the sum(S) and the carry- out (Cout).
The full adder becomes necessary when a carry input must be added to the two binary digits to obtain the
correct sum. A half adder has no input for carries from previous circuits.

Truth table of the Full-Adder is given below


The Boolean expression for the sum (S) and carry-out (Cout) of full adder is,

SUM = A'B'C + A'BC' + AB'C' + ABC


Cout = A'BC + AB'C + ABC' + ABC

SIMPLIFICATION OF LOGIC EQUATIONS


SUM = A'B'C + A'BC' + AB'C' + ABC
= A’(B’C+BC’) + A(B’C’+BC)
=A⊕ B⊕ C

Cout = A'BC + AB'C + ABC' +ABC


= A'BC + ABC+ AB'C +ABC'
= AB(C+C’) + C(A’B+AB’)
= AB + C (A⊕ B)

Circuit Diagram:
Half adder:

Full Adder:
2.6 Procedure:

1. Place the breadboard gently on the observation table.


2. Fix the IC which is under observation between the half shadow line of the breadboard, so
there is no shortage of voltage.
3. Connect the wire to the main voltage source (Vcc) whose other end is connected to the last
pin of the IC (14 place from the notch).
4. Connect the ground of IC (7th place from the notch) to the ground terminal provided on
the digital lab kit.
5. Give the input at the gate of the ICs by using connecting wires. (In accordance with to provided).
6. Connect output pins to the LED on the digital lab kit.
7. Switch on the power supply.
8. If led glows then output is true, if it doesn’t glow output is false, which is numerically
denoted as 1 and 0 respectively.
9. Verify the truth table.

2.7 Precautions:

1. All ICs should be checked before starting the experiment.


2. All the connections should be tight.
3. Always connect ground first and then connect Vcc.
4. Use suitable wire should be used for different types of circuit.
5. The kit should be off before changing the connections.
6. After the completion of the experiment, switch off the supply of the apparatus.
2.8 Conclusion:

In conclusion, we successfully designed and implemented both the half adder and full
adder circuits using basic logic gates. The circuits were tested, and the outputs matched the
expected results, confirming the accuracy of the design and functionality of the adders.
2.9 Questions:

You might also like