Vous êtes sur la page 1sur 14

DEPARTMENT OF TECHNICAL EDUCATION

Name
Designation
Branch
Institute

:
:
:
:

Year/ Semester
Subject
Subject Code
Topic
Duration
Sub topic
Teaching aids

:
:
:
:
:
:
:

B. Rama Sundari
Lecturer in ECE
Electronics & Comm. Engg.
Govt. Polytechnic for women,
Guntur
III
Digital Electronics
CM-305
Logic gates & Boolean Algebra
50 mts.
Diagrams
CM305 .13

Recap
Binary arithmetic operations

(c ) Symbol & operation

CM305 .13

Objectives
On completion of this period, you would be able
to know
Draw block diagram of full adder

CM305 .13

Addition of two 3-bit binary numbers

Fig 13.1
CM305 .13

It is a combinational logic circuit

CM305 .13

Fig 13.2

CM305 .13

CARRY
IN

input B

input A

CARRY
OUT

SUM
digit

0
0
0
0
1
1
1
1

0
0
1
1
0
0
1
1

0
1
0
1
0
1
0
1

0
0
0
1
0
1
1
1

0
1
1
0
1
0
0
1

Table 13.1
CM305 .13

Simple representation of a full adder

A
Cin
(carry in)

Full

Cout

(carry out)

Sum
Fig 13.3

S = A B Ci
= ABC i + ABC i + ABCi + ABCi
C o = AB + BCi + ACi
CM305 .13

Summary

A full adder is a combinational logic circuit that

consists of two half adders and one OR gate

CM305 .13

Quiz

1. 1

2. 2
3. 3
4. any number

CM305 .13

10

A full adder has two inputs and outputs

1. 1
2. 2
3. 3
4. any number

CM305 .13

11

1. two NAND gates and one OR gate
2. two half adders and one OR gate

3. one EX-OR gate, one NOR gate,

one AND gate
4. one NOR gate, two half adders
CM305 .13

12

1.

2.

Show that a full adder can be constructed using

two half adders and an OR gate

CM305 .13

13

Assignment

1.

2.

Construct full adder using 3 and gates, 10R

and 1. ex- or gate.

CM305 .13

14