Scribd
Upload
206 views

AIM Theory Basic Gates The Nor Gate The Nand Gate Bibliography

The document discusses logic gates and their truth tables. It begins with an introduction to logic gates, their basic components and functions. It then discusses two specific logic gates - the NOR gate and the NAND gate - defining their components, construction, boolean expressions, and providing their truth tables. It notes that NAND and NOR gates are considered universal gates as any other logic gate can be created using just these two gates.

Uploaded by

JsmBhanot
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
206 views

AIM Theory Basic Gates The Nor Gate The Nand Gate Bibliography

The document discusses logic gates and their truth tables. It begins with an introduction to logic gates, their basic components and functions. It then discusses two specific logic gates - the NOR gate and the NAND gate - defining their components, construction, boolean expressions, and providing their truth tables. It notes that NAND and NOR gates are considered universal gates as any other logic gate can be created using just these two gates.

Uploaded by

JsmBhanot
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 18

CONTENTS

AIM
INTRODUCTION
THEORY
BASIC GATES
THE NOR GATE
THE NAND GATE
BIBLIOGRAPHY

PAGE No.-1

"TO

DESIGN AN
APPROPRIATE nor & nand
LOGIC GATE FOR A GIVEN
TRUTH TABLE"

PAGE No.-2

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 combinations.
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
PAGE No.-3

HIGH/LOW,
ON/OFF,
CLOSED/OPEN,
YES/NO,
RIGHT/WRONG,
TRUE/FALSE, CONDUCTING/NONCONDUCTING 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

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.
PAGE No.-4

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

HIGH

LOW

+v

-v

ON

OFF

CLOS
E

OPEN

RIGH WRON
T
G
TRUE FALSE
YES

NO

PAGE No.-5

(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.

PAGE No.-6

(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.

Aim:
PAGE No.-7

TO DESIGN AND SIMULATE THE NOR GATE


CIRCUIT.

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

Theory and Construction:


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.
PAGE No.-8

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
0
1
0
1

Input B
0
0
1
1

Output Y
1
0
0
0

Aim:
PAGE No.-9

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.

Theory and Construction:


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:

PAGE No.-10

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
0
1
0
1

Input
B
0
0
1
1

Output
Y
1
1
1
0

PAGE No.-11

What are a Universal Gate


And why NAND and NOR are
known as universal gates?
BIBLIOGRAPHY
A gate which can be use to create any
Logic gate is called Universal Gate
NAND and NOR are called Universal
Gates because all the other gates can be
created by using these gates
Proof for NAND gates.

Any Boolean function

can be implemented using AND, OR and


NOT
gates
In the same way AND, OR and NOT
gates can be implemented using NAND
gates only,

PAGE No.-12

PAGE No.-13

PAGE No.-14

PAGE No.-15

I
PAGE No.-16

PAGE No.-17

Bibliography
I would like to acknowledge the following
sources through which I obtained vital
information which contributed in the
completion of this project:
I.
II.
III.
IV.

slideshare.com
wikipedia.org
icbse.co.in
scribd.com

PAGE No.-18

You might also like