Phy Project
Phy Project
Phy Project
PROJECT DONE BY
NAME :T SUDHASATHVIK REDDY
ROLL NO :
CLASS :XII
CERTIFICATE
Date:
Place:
Institute Stamp
Sr.no Title Page no.
1 Introduction 1
2 Principle 2
3 Basic Gates 3
4 The OR Gate 5
10 The EX-NOR 17
Gate
11 Conclusion 19
12 Bibliography 20
Introduction
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.
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.
Boolean algebra: - The algebra which is based on
binary nature of the logic gates.
1
Principle
Any Boolean algebraic operation can be associated
with the input and output, which represents the
statement of Boolean algebra. Although these circuits
may be complex, they may all be constructed from
three basic
Devices like a P-N junction diode, a resistance and an
N-P- N transistor.
We have three different type of logic gates and they
are the AND gate, the OR gate and the NOT gate.
LOGICAL STATEMENTS
1 0
High Low
Positive Negative
On Off
Close Open
Conducting Non-Conducting
Right Wrong
True False
Yes No
2
Basic Gates
The OR Gate: - It is a device that combines A and B to
give Y as the result. The OR gate has two or more inputs
and one o utput . In Boolean algebra, addition symbol (+),
is referred as the OR.
The Boolean expression: A+B=Y
This indicates that Y equals to A or B.
3
The NOT Gate: - It is a device that inverts the inputs.
The NOT has one input and has one o utpu t. In Boolean
algebra, bar symbol is referred as the NOT.
The Boolean expression:
4
The OR Gate
Aim:
To design and stimulate the OR gate circuit.
Components:
Two ideal p-n junction diode (D1 and D2).
5
The following conclusion can be drawn from the
above circuit:
(i) If the switch A and B are kept open
(A=1, B=0), then bulb does not glow,
hence Y=0
(ii) If switch A is kept closed and B is kept
open (A=1, B=0), then bulb does not
glow, hence Y=0
(iii) If switch A is kept open and B is kept
closed (A=0, B=1), then bulb does not
glow, hence Y=0
(iv) If switch A and B both are kept closed
(A=1, B=1), then bulb glows, hence Y=1
TRUTH TABLE:
Input A Input B OUTPUT
0 0 0
0 1 0
1 0 0
1 1 1
6
The AND Gate
Aim:
TO DESIGN AND STIMULATE THE AND
GATE CIRCUIT.
Components:
Two ideal p-n junction diode (D1 and D2) and resistance R.
7
The following conclusion can be easily drawn from
the working of this circuit:
(i) If the switch A and B are kept open (A=0,
B=0), then bulb does not glow, hence Y=0.
(ii) If switch A is kept closed and B is kept
open (A=1, B=0), then bulb does not glow,
hence Y=0.
(iii) If switch A is kept open and B is kept
closed (A=0, B=1), then bulb does not
glow, hence Y=0.
(iv) If both switch A and B are kept closed
(A=1, B=1), then bulb glows, hence Y=1.
TRUTH TABLE:
Input A Input B OUTPUT
0 0 0
0 1 0
1 0 0
1 1 1
8
The NOT Gate
Aim:
TO DESIGN AND STIMULATE THE NOT
GATE CIRCUIT.
Components:
An ideal n-p-n transistor.
9
The following inference can be easily drawn from
the working of circuit:
(i) If the switch A is kept open (A=0) then
bulb glows, hence Y=1
(ii) If the switch A is kept closed (A=1)
then bulb does not glow, hence Y=0
TRUTH TABLE:
Input A OUTPUT Y
0 1
1 0
10
The NOR Gate
Aim:
TO DESIGN AND STIMULATE THE
NOR GATE CIRCUIT.
Component:
Two ideal p-n junction diode (D1 and D2).
An ideal n-p-n transistor
11
In Boolean expression, the NOR gate is expressed
as:
12
The NAND Gate
Aim:
TO DESIGN AND STIMULATE THE NAND
GATE CIRCUIT.
Components:
Two ideal p-n junction diode (D1 and D2)
A resistance R
An ideal n-p-n transistor
13
In Boolean expression, the NAND gate is expressed
as:
14
The EX-OR Gate
Aim:
TO DESIGN AND STIMULATE THE
EX-OR GATE CIRCUIT.
Components:
1) Two AND gates
2) An OR gate
3) Two NOT gate
Theory and Construction:
The operation EX-OR checks for the
exclusivity in the value of the two signals A
and B. It means if A and B are not identical,
the output Y=1, and if both are identical, then
output Y=0. This operation is also called
exclusive OR gate, designated EX-OR.
15
In Boolean expression, the EX-OR ga t e is
expressed as:
16
The EX-NOR Gate
Aim:
TO DESIGN AND STIMULATE THE
EX-NOR GATE CIRCUIT.
Components:
1) Two AND gates
2) And OR gate
3) Three NOT gates
Theory and Components:
The operation EX-NOR checks for the
exclusively in the value of the two signals A
and B. it means if A and B are not identical, the
output Y=0, and if both are identical, then the
output Y=1. This operation is also called
exclusive NOR gate, designated EX-NOR.
17
In Boolean expression, the EX-NOR gate is
expressed as
TRUTH TABLE:
Input A Input B OUTPUT
0 0 1
0 1 0
1 0 0
1 1 1
18
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.
19
Bibliography
This project would be nearly incomplete if
I had not used the information given in
the following websites.
My special thanks to the up loader of
information on these websites. If
considered, I have used everything that
GOOGLE shows me…….
20