0% found this document useful (0 votes)
7 views8 pages

EXP 1,2

The document outlines experiments to verify the truth tables of half adders, full adders, half subtractors, and full subtractors using digital circuits. It includes the necessary apparatus, theoretical background, functional tables, Boolean expressions, procedures for conducting the experiments, and precautions to ensure safety and accuracy. The results confirm the verification of the truth tables for both addition and subtraction operations in digital electronics.

Uploaded by

Abhishek Goswami
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)
7 views8 pages

EXP 1,2

The document outlines experiments to verify the truth tables of half adders, full adders, half subtractors, and full subtractors using digital circuits. It includes the necessary apparatus, theoretical background, functional tables, Boolean expressions, procedures for conducting the experiments, and precautions to ensure safety and accuracy. The results confirm the verification of the truth tables for both addition and subtraction operations in digital electronics.

Uploaded by

Abhishek Goswami
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/ 8

Experiment - 1

Aim

To verify the truth table of half adder and full adder.

Apparatus Required:

Digital trainer kit, IC 7486, IC 7432, IC 7408, Connec ng wires.

Theory

Adder circuit is a combina onal 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 applica ons in digital electronics like address
decoding, table index calcula on etc. Adder circuits are of two types: Half adder ad Full adder

Half adder

A half adder is a combina onal 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). Carry is the higher
order bit and the sum is the lower order bit of the output. Func onal Table of the Half-Adder
is given below

Func onal Table of Half Adder

A B Sum Carry

0 0 0 0

0 1 1 0

1 0 1 0

1 1 0 1
The Boolean expression for the sum (S) and carry(C) of half adder is,

Sum = AB' + A'B = A⊕B

Carry= A.B

Full adder

A full adder is a combina onal 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

Func onal Table of Full Adder

A B C Sum 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
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

Simplifica on of Logic Equa ons

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)
The full adder drawn above can be visualized as a combina on of two half adders. It uses two
XOR gates, the output of 1st XOR gate (i.e. Sum A+B) is taken as input to 2nd XOR gate and the
other is the third input( usually the Cin), the outputs of the AND gates which are nothing but
the carry of HA are ORed together. The FA drawn as a combina on of two HA is shown below.

Procedure:-

1. Place the breadboard gently on the observa on table.


2. Fix the IC which is under observa on between the half shadow line of breadboard, so
there is no shortage of voltage.

3. Connect the wire to the main voltage source (Vcc) whose other end is connected to
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 connec ng wires. (In accordance to IC
provided).

6. Connect output pins to the led on 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 0respec vely.

9. Verify the truth table

Precau ons:

1. All ICs should be checked before star ng the experiment.

2. All the connec on should be ght.

3. Always connect ground first and then connect Vcc.

4. Suitable type wire should be used for different types of circuit.

5. The kit should be off before changing the connec ons.

6. a er the comple on of experiment, switch off the supply of the apparatus.

Result:

The truth table of half adder and full adder is verified.


Experiment – 2

Aim

To verify the truth table of half and full subtractor.

Apparatus Required:

Digital trainer kit, IC 7486, IC 7432, IC 7408, IC 7404 Connec ng wires.

Theory

Half Subtractor

A half subtractor is a logical circuit that performs a subtrac on opera on on two single binary
digits. The half subtractor produces a difference and a borrow bit for the next stage.

From the truth table of the half subtractor we can see that the difference (D) output is the
result of the Exclusive-OR gate and the Borrow-out (B) is the result of the NOT-AND
combina on. Then the Boolean expression for a half subtractor is as follows.

For the difference bit:

D = X XOR Y = X ⊕ Y

For the Borrow bit

B = not-X AND Y = X.Y

Full Subtractor

A full subtractor has three inputs. The two single bit data inputs X (minuend) and
Y(subtrahend) the same as before plus an addi onal Borrow-in (B-in) input to receive the
borrow generated by the subtrac on process from a previous stage as shown below.
For the difference(D)bit:

D = (X’.Y’.Bin) + (X’.Y.Bin’) + (X.Y’.Bin’) + (X.Y.Bin)

which can be simplified too:

D = (X XOR Y) XOR Bin = (X ⊕ Y) ⊕ Bin

For the borrow out (Bout) bit:

Bout = (X’.Y’.Bin) + (X’.Y.Bin’) + (X’.Y.Bin) + (X.Y.Bin)

which will also simplify too:

Bout = X’ AND Y OR (X XOR Y)’Bin = X’.Y + (X ⊕ Y)’Bin

Procedure:-

1. Place the breadboard gently on the observa on table.


2. Fix the IC which is under observa on between the half shadow lineof breadboard, so
there is no shortage of voltage.

3. Connect the wire to the main voltage source (Vcc) whose other end is connected to
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 connec ng wires. (In accordance toIC
provided).

6. Connect output pins to the led on 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 0respec vely.

9. Verify the truth table.

Precau ons:

1. All ICs should be checked before star ng the experiment.

2. All the connec on should be ght.

3. Always connect ground first and then connect Vcc.

4. Suitable type wire should be used for different types of circuit.

5. The kit should be off before changing the connec ons

6. a er the comple on of experiment, switch off the supply of the apparatus.

Result:

The truth table of half subtractor and full subtractor is verified.

You might also like