Bona Fide Certificate: Physics
Bona Fide Certificate: Physics
2016-2017
1 | Page
ACKNOWLEDGEMENT
I'd like to express my greatest
gratitude to the people who have
helped & supported me throughout my
project. Im grateful to
for his continuous support for the
project,
from
initial
advice
&
encouragement to this day.
Special thanks of mine goes to my
brother who helped me in completing
the project by giving interesting ideas,
thoughts & made this project easy and
accurate.
I wish to thanks my parents for
their undivided support & interest who
inspired me & encouraged me to go
my own way, without which I would be
unable to complete my project. At last
but not the least I want to thanks my
friends who appreciated me for my
work & motivated me and finally to
God who made all the things
2 | Page
possible
SN
o.
I.
II.
III.
IV.
V.
VI.
VII.
VIII.
IX.
X
Contents
Index
Pa
ge
No
.
1
2
3
4
5
6
7
8
Introduction
Principle
Basic Gates
OR Gate
AND Gate
NOT Gate
NOR Gate
NAND Gate
Some
Applications
9
of Logic Gates
BIBLOGRAPHY 10
3 | Page
Introduction
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 as
stop, it is called a gate. The logic gates are
building blocks at digital electronics. They are
used in digital electronics to change on voltage
level (input voltage) into another (output
voltage) according to some logical statement
relating them.
A logic gate may have one or more inputs, but it
has only one output. The relationship between
the possible values of input and output voltage
is expressed in the form of a table called truth
table or table of combination. Truth table of
a Logic Gates is a table that shows all the input
and output possibilities for the logic gate.
George Boole in 1980 invented a different
kind of algebra based on binary nature at the
logic, this algebra of logic called BOOLEAN
ALGEBRA. A logical statement can have only
two values, such as HIGH/LOW, ON/OFF,
4 | Page
CLOSED/OPEN,
YES/NO,
RIGHT/WRONG,
TRUE/FALSE, CONDUCTING/NON-CONDUCTING
etc. The two values of logic statements one
denoted by the binary number 1 and 0. The
binary number 1 is used to denote the high
value. The logical statements that logic gates
follow are called Boolean expressions.
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.
5 | Page
BASIC GATES
6 | Page
7 | Page
8 | Page
THE OR GATE
Aim:
TO DESIGN AND SIMULATE THE OR GATE
CIRCUIT.
Components:
Two ideal p-n junction diode (D1 and D2).
Truth
Input
A
Input Output
B
Y
0
1
10 | P a g e
Table:
Components:
Two ideal p-n junction diode (D1 and D2), a
resistance R.
11 | P a g e
Input A
Input B
Output Y
0
12 | P a g e
Truth
Table:
Components:
An ideal n-p-n transistor.
13 | P a g e
Truth Table:
Input A
Output Y
14 | P a g e
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.
15 | P a g e
Truth Table:
16 | P a g e
Input A
Input B
Output Y
17 | P a g e
Components:
Two ideal p-n junction diode (D1 and D2), a
resistance R, an ideal n-p-n transistor.
18 | P a g e
Truth Table:
Input A
Input B
Output Y
19 | P a g e
Application of OR gate
Wherever the occurrence of any one or more
than one event is needed to be detected or
some actions are to be taken after their
occurrence, in all those cases OR gates can be
used. It can be explained with an example.
Suppose in an industrial plant if one or more
than one parameter exceeds the safe value,
some protective measure is needed to be done.
In that case OR gate is used. We are going to
show this with the help of a diagram. The above
figure is a typical schematic diagram where an
OR gate is used to detect exceed of
temperature or pressure and produce command
signal for the system to take required actions.
20 | P a g e
21 | P a g e
Application
23 | P a g e