LOGIC GATE

CIRCUITS

NAME: SAURAV KUMAR

CLASS: XIIth SECTION: 'A1'

ROLL NO.: 03

GUIDED BY: MISS ANUPAMA KAUSHAL

SCHOOL: B.D. PUBLIC SCHOOL

Ashank
12-Neelambari
ACKNOWLEDGEMENT
MERE WORDS WON'T BE ABLE TO EXPRESS MY
GRATITUDE AND THANKFULNESS FOR THE VARIOUS
PEOPLE WITHOUT WHOSE INVOLVEMENT THIS PROJECT
COUNLDN'T HAVE BEEN COMPLETED SUCCESSFULLY.

FIRST OF ALL, I WOULD LIKE TO EXPRESS MY HEARTY

GRATITUDE FOR Krishnamoorthy SIR, MY PHYSICS
TEACHER WITHOU T WHOSE SUPPORT AND GUIDANCE
THIS VERY PROJECT COULDN'T HAVE BEEN POSSIBLE. I
WOULD ALSO LIKE TO THANK Ms. ,
OUR PHYSICS LAB ASSISTANT, WHO WAS ALWAYS THERE
TO HELP US OUT OUR PROBLEMS.

LASTLY, I WOULD LIKE TO END UP THANKING ALL MY

FRIENDS AND MY PARENTS TOO WITHOUT WHOSE
CONTRIBUTION THE WORK ENTERED IN THIS FILE
WOULDN'T BE A REALITY.
 CONTENTS

AIM
INTRODUCTION
THEORY
BASIC GATES
THE OR GATE
THE AND GATE
THE NOT GATE
THE NOR GATE
THE NAND GATE
THE XOR GATE
THE XNOR GATE
CONCLUSION
 AIM

To study the various

logic gate circuits.
 INTRODUCTION
1.Gate: A gate is defined as a digital circuit which
follows some logical relationship between the input and
output voltages. It is a digital circuit which either allows
a signal to pass through or stop it.
> The logic gates are building blocks at digital
electronics. They are used in digital electronics to
change one voltage level into another according to
some logic statement relating to them.
2.Truth Table: A logic gate may have one or more than
one inputs, but it has only one output. The relationship
between the possible values of input and output voltages
are expressed in the form of a table called truth table.
> Truth table of a logic gate is a table that shows all
the inputs and outputs that are possible for the logic
gates.
3.Boolean Algebra: The algebra which is based on
binary nature of the logic gates.
4.Boolean Expressions: They are the logical
statement which are followed by logical gates.
 THEORY
Logic gates or logic gate is an entity in electronics and mathematics
Boolean that turns one or more logic inputs to a logic output signal. Logic
gate is mainly implemented electronically using diodes or transistors, but
can also be built using the arrangement of components that utilize the
properties of electromagnetic (relay), fluids, optical or even mechanical.
Any Boolean algebra operation can be associated with inputs and outputs
represent the statements of Boolean algebra. Although these circuits may
be complex, they may all be constructed from three basic devices. We
have three different types of logic gates. These are the AND gate, the OR
gate and the NOT gate.

LOGIC STATES
1 0
HIGH LOW
+v -v
ON OFF
CLOSE OPEN
RIGHT WRONG
TRUE FALSE
YES NO
 BASIC GATES
(a) THE OR GATE is a device that combines A with B to give Y as the
result.
The OR gate has two or more inputs and one output. The logic
gate of OR gate with A and B input and Y output is shown below:

In Boolean algebra, addition symbol (+) is referred as the OR.

The Boolean expression:
A+B=Y, indicates Y equals A OR B.

(b) THE AND GATE is a device that combines A with B to give Y as

the result.
The AND gate has two or more inputs and one output. The logic
gate of AND gate with A and B input and Y output is shown
below:
 In Boolean algebra, multiplication sign (either x or.) is referred as
the AND. The Boolean expression:
A.B=Y, indicates Y equals A AND B.

(c) THE NOT GATE is a device that inverts the inputs. The NOT is a
one input and one output. The logic gate of NOT gate with A and
Y output is shown below:

In Boolean algebra, bar symbol (_) is referred as the NOT. The

Boolean expression:
à =Y, indicates Y equals NOT A.
 THE ‘OR’ GATE
Aim:
TO DESIGN AND SIMULATE THE OR GATE CIRCUIT.

Components:
Two ideal p-n junction diode (D1 and D2).

Procedure:
An OR gate can be realize by the electronic
circuit, making use of two diodes D1 and D2 as shown
in the figure.
Here the negative terminal of the battery is grounded
and corresponds to the 0 level, and the positive
terminal of the battery (i.e. voltage 5V in the present
case) corresponds to level 1. The output Y is voltage
at C w.r.t. earth.
The following interference can be easily drawn from
the working of electrical circuit is:
a) If switch A & B are open lamp do not glow
(A=0, B=0), hence Y=0.
b) If Switch A open B closed then (A=0, B=1)
Lamp glow, hence Y=1.
c) If switch A closed B open then (A=1, B=0)
Lamp glow, hence Y=1.
d) If switch A & B are closed then (A=1, B=1)
Lamp glow, hence Y=1.

Truth Table:
Input A Input B Output Y
0 0 0
1 0 1
0 1 1
1 1 1
 THE ‘AND’ GATE
Aim:
TO DESIGN AND SIMULATE THE AND GATE CIRCUIT.

Components:
Two ideal p-n junction diode (D1 and D2), a
resistance R.

Procedure:
An AND gate can be realize by the electronic
circuit, making use of two diodes D1 and D2 as shown
in the figure. The resistance R is connected to the
positive terminal of a 5V battery permanently.
Here the negative terminal of the battery is grounded
and corresponds to the 0 level, and the positive
terminal of the battery (i.e. voltage 5V in the present
case) corresponds to level 1. The output Y is voltage
at C w.r.t. earth.
The following conclusions can be easily drawn from
the working of electrical circuit:
a) If both switches A&B are open (A=0, B=0)
then lamp will not glow, hence Y=0.
b) If Switch A closed & B open (A=1, B=0) then
Lamp will not glow, hence Y=0.
c) If switch A open & B closed (A=0, B=1) then
Lamp will not glow, hence Y=0.
d) If switch A & B both closed (A=1, B=1) then
Lamp will glow, hence Y=1.

Truth Table:

Input A Input B Output Y

0 0 0
1 0 0
0 1 0
1 1 1
THE ‘NOT’ GATE
Aim:
TO DESIGN AND SIMULATE THE NOT GATE CIRCUIT.

Components:
An ideal n-p-n transistor.

Procedure:
A NOT gate cannot be realized by using diodes.
However an electronic circuit of NOT gate can be
realized by making use of n-p-n transistor as shown
in the figure.

The base B of the transistor is connected to the input

A through a resistance Rb and the emitter E is
earthed. The collector is connected to 5V battery. The
output Y is voltage at C w.r.t. earth.
The following conclusion can be easily drawn from
the working of the electrical circuit:

a) If switch A is open (i.e. A=0), the lump will

glow, hence Y=1.
b) If Switch A is closed (i.e. A=1), the lump will
not glow, hence Y=0.

Truth Table:

Input A Output Y
0 1
1 0
 THE ‘NOR’ GATE
Aim:
TO DESIGN AND SIMULATE THE NOR GATE CIRCUIT.

Components:
Two ideal p-n junction diode (D1 and D2), an ideal n-
p-n transistor.

Procedure:
If we connect the output Y’ of OR gate to the input of
a NOT gate the gate obtained is called NOR.
The output Y is voltage at C w.r.t. earth.

In Boolean expression, the NOR gate is expressed as

Y=A+B, and is being read as ‘A OR B negated’. The
following interference can be easily drawn from the
working of electrical circuit is:

a) If Switch A & B open (A=0, B=0) then Lamp

will glow, hence Y=1.
b) If Switch A closed & B open (A=1, B=0) then
Lamp will not glow, hence Y=0.
c) If Switch A open & B close (A=0, B=1) then
Lamp will not glow, hence Y=0.
d) If switch A & B are closed then (A=1, B=1)
Lamp will not glow, hence Y=0.

Truth Table:

Input A Input B Output Y

0 0 1
1 0 0
0 1 0
1 1 0
 THE ‘NAND’ GATE
Aim:
TO DESIGN AND SIMULATE THE NAND GATE CIRCUIT.

Components:
Two ideal p-n junction diode (D1 and D2), a
resistance R, an ideal n-p-n transistor.

Procedure:
If we connect the output Y’ of AND gate to the input
of a NOT gate the gate obtained is called NAND.
The output Y is voltage C w.r.t.earth.

In Boolean expression, the NAND gate is expressed

as Y=A.B, and is being read as ‘A AND B negated’.
The following
interference can be easily drawn from the working of
electrical circuit:
a) If Switch A & B open (A=0, B=0) then Lamp
will glow, hence Y=1.
b) If Switch A open B closed then (A=0, B=1)
Lamp glow, hence Y=1.
c) If switch A closed B open then (A=1, B=0)
Lamp glow, hence Y=1.
d) If switch A & B are closed then (A=1, B=1)
Lamp will not glow, hence Y=0.
Truth Table:

Input A Input B Output Y

0 0 1
1 0 1
0 1 1
1 1 0
 THE ‘XOR’ GATE
Aim:
TO DESIGN AND SIMULATE THE EX OR GATE CIRCUIT.

Components:
Two AND gate, an OR gate, two NOT gate.

Procedure:
The operation XOR checks for the exclusivity in the
value of the two signals A and B. It means if A and B
are not identical (i.e. if A=0 and B=1 or vice versa),
the output Y=1, and if both are identical, then the
output Y=0. This operation is also called exclusive
OR gate, designated EXOR.
In Boolean expression, the EX OR gate is expressed
as
Y=A.B + A.B =
The following interference can be easily drawn from
the working of electrical circuit:
a) If both switches A&B are open (A=0, B=0)
then lamp will not glow, hence Y=0.
b) If Switch A open B closed then (A=0, B=1)
Lamp glow, hence Y=1.
c) If switch A closed B open then (A=1, B=0)
Lamp glow, hence Y=1.
d) If switch A & B are closed then (A=1, B=1)
Lamp will not glow, hence Y=0.

Truth Table:

Input A Input B Output Y

0 0 0
1 0 1
0 1 1
1 1 0
 THE XNOR GATE
Aim:
TO DESIGN AND SIMULATE THE EX NOR GATE CIRCUIT.

Components:
Two AND gates, an OR gates, three NOT gates.

Procedure:
The operation XNOR checks for the exclusivity in the
value of the two signals A and B. It means if A and B
are not identical (i.e. if A=0 and B=1 or vice versa),
the output Y=0, and if both are identical, then the
output Y=1. This operation is also called exclusive
NOR gate, designated XNOR.

In Boolean expression, the XNOR gate is expressed as

Y=A.B + A.B =
The following interference can be easily drawn from
the working of electrical circuit:
a) If Switch A & B open (A=0, B=0) then Lamp
will glow, hence Y=1.
b) If Switch A closed & B open (A=1, B=0) then
Lamp will not glow, hence Y=0.
c) If Switch A open & B close (A=0, B=1) then
Lamp will not glow, hence Y=0.
d) If switch A & B both closed (A=1, B=1) then
Lamp will glow, hence Y=1.
Truth Table:

Input A Input B Output Y

0 0 1
1 0 0
0 1 0
1 1 1
 Conclusion

Logic gates are used to develop many IC

circuits or microchips in today’s modern world.
NAND gate and NOR gate are known as
universal gates because we can construct all
the three basic gates using NAND & NOR
gates. Without logic gates, electronic world
would be nearly incomplete!