Scribd
Upload
16 views

EXP1

The document discusses implementing half adders and full adders using logic gates. It provides the theory behind half adders and full adders, including their expressions and truth tables. An experiment is described to verify the truth tables by implementing the circuits using common logic gates.

Uploaded by

jyotirmaypatel
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
16 views

EXP1

The document discusses implementing half adders and full adders using logic gates. It provides the theory behind half adders and full adders, including their expressions and truth tables. An experiment is described to verify the truth tables by implementing the circuits using common logic gates.

Uploaded by

jyotirmaypatel
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
You are on page 1/ 3

EXPERMIENT-1

OBJECT: Implementation of HALF ADDER, FULL ADDER using basic logic gates.

APPARATUS USED:-
1. General-purpose trainer board.
2. IC 7404 - one(NOT Gate)
3. IC 7408 -one(AND Gate)
4. IC 7432 - one (OR Gate)
5. IC 7486 -one(Ex-OR Gate)
5. Patch Cords
THEORY: -
THEORY:-Half Adder:
The most basic arithmetic operations, no doubt is the addition of two binary digits. This
simple addition consists of four possible elementary operations, namely
0+0=0,0+1=1;1+0=1,1+1=10, the first three operations produced a sum whose length is one
digit, but when both term and added bit are equal to 1, the binary sum consists of two digits.
The higher significant bit of this result is called a carry when the augends and added numbers
contain more significant digits, the carry obtained from the addition of two bits is added to
the next higher order pair of significant bits. A combinational circuit that performs the
addition of two bits is called a HALF ADDER.
Expression For Half Adder:

sum= X’Y+XY’
carry= XY
TRUTH TABLE:-

INPUT OUTPUT
X Y sum carry
0 0 0 0
0 1 1 0
1 0 1 0
1 1 0 1
THEORY:-Full Adder:

The most basic arithmetic operations, no doubt , is the addition of two binary digits. This
simple addition consists of four possible elementary operations, namely,0+0=0,0+1=1,1+0=1,
1+1=10. the first three operations produce a sum whose length is one digit, but when both
augends and added bit are equal to 1,the binary sum consists of two digits. The higher
significant bit of this result is called a carry. When the augends and added numbers contain
more significant digits, the carry obtained from the addition of two bits is added to the next
higher order pair of significant bits. a combinational circuit that performs the addition of two
bits is called a half adder. One that performs the addition of three bits is a full adder.

Expression For Full Adder:

sum= X’Y’Z+X’YZ’+XY’Z’+XYZ
carry= XY+YZ+ZX
RESULT: The truth table is verified.

PRECAUTIONS:
1. Make the connection according to the circuit diagram.
2. Check the connections before on the supply.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy