0% found this document useful (0 votes)
34 views19 pages

Physics Investigatory Project 2021-22

The document describes designing and simulating basic logic gates. It includes an introduction to logic gates, the aim to design gates and combinations for truth tables. It explains gates like OR, AND, NOT. Circuits are prepared and observations made for each gate and a NAND gate combination is designed for a sample truth table.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
34 views19 pages

Physics Investigatory Project 2021-22

The document describes designing and simulating basic logic gates. It includes an introduction to logic gates, the aim to design gates and combinations for truth tables. It explains gates like OR, AND, NOT. Circuits are prepared and observations made for each gate and a NAND gate combination is designed for a sample truth table.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 19

TAGORE PUBLIC SCHOOL

JAIPUR

PHYSICS PROJECT
ON
AIM
To design and simulate basic logic gates
and to design an appropriate logic gate
combination for a given truth table.

SESSION 2021-22
SUBMITTED BY: KALKI IMAYAVARAMBAN S SUBMITTED TO: GARIMA MISHRA
XII
ACKNOWLWDGEMENT

I am grateful to Dr. Mamta Mishra


(Principal) for her support and
motivation. I would also like to thank
Mrs. Garima Mishra (Physics Teacher)
for their constant support and
guidance in making project.
I would also like to thank the CBSE
Board for giving me an opportunity to
make this project and providing
suitable guidelines for the same.
CERTIFICATE

This is to certify that Kalki Imayavaramban


of class XII D has successfully completed
his investigatory project on the topic “To
design and simulate basic logic gates and
to design an appropriate logic gate
combination for a given truth table” for
the academic year 2021-22.
This project is complete in all respect.

Dr. Mamta Mishra Mrs. Garima Mishra

(Principal) (Teacher-in-charge)
INDEX
S.No. Content Page No.

1. Introduction 5
2. Aim 6
3. Requirement 6
4. Theory 7
5. Procedure 9
6. Circuits Prepared 15
6. Observation 17
7. Result 19
9. Bibliography 19
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 or stop, it is called a gate.
The logic gates are building blocks at digital electronics. They are used in
digital electronics to change one 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 HIGH/LOW,
ON/OFF, CLOSED/OPEN, YES/NO, RIGHT/WRONG, TRUE/FALSE,
CONDUCTING/NON-CONDUCTING, etc.
The two values of the logic statements are denoted by binary number 1
and 0. The binary number 1 is used to denote the higher value. The logical
statements that the logic gates follow are called BOOLEAN
EXPRESSIONS.
The five common logic gates used are NOT, AND, OR, NAND, NOR.
Each logic gate is indicated by a symbol and its function is defined by a
truth table that shows all the possible input logic level combinations with
their respective output logic levels.
AIM:
To design and simulate basic logic gates and to design
an appropriate logic gate combination for a given truth
table.

APPARATUS REQUIRED:
 Breadboard
 Torch bulb
 Switches
 Connecting wires
 Battery
THEORY
A logical statement can have only two values either high/low or on/off.
The two values of logic statement one is denoted by the binary number 1
and zero is denoted by the binary number 0. 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. 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.

THE OR GATE –
It 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:-

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


The Boolean expression: A+B = Y indicates Y equals A OR B.
THE AND GATE –
It 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.

THE NOT GATE –


It 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.
PROCEDURE
Construction of Basic logic gates

THE OR GATE:
An OR gate can be realize by the electronic circuit, making use of two
switches A and B as shown in the figure.

Truth Table
THE AND GATE:
An AND gate can be realize by the electronic circuit, making use of two
switches A and B as shown in the figure.

Truth Table
THE NOT GATE:
An NOR gate can be realize by the electronic circuit, making use a switch
A as shown in the figure.

Truth Table

THE NOR GATE:


If we connect the output Y' of OR gate to the input of a NOT gate the gate
obtained is called NOR. Boolean expression, the NOR gate is expressed as
Y=(A+B)’, and is being read as 'A OR B negated'.
THE NAND GATE:
If we connect the output Y' of AND gate to the input of a NOT gate the
gate obtained is called NAND. Boolean expression of NAND gate is
expressed as Y=(A.B)’ and is being read as 'A and B negated'.
Logic gate combination for given truth table

1. Write product term for each input (minterm), Combination where


Boolean function has output
2. While writing minterms, complement the variable whose value is 0
otherwise write it in the direct form (without complement)
3. Add all the minterms to obtain the Boolean function
4. Draw the circuit using basic LOGIC Gates.

So we, choose the given Truth Table.

A B Y=A.B Y’
0 0 0 1
0 1 0 1
1 0 0 1
1 1 1 0

The Boolean Function F(x, y) is obtained as:


F(x,y)= X’.Y’+X.Y’+X’Y
= Y’+X’Y = (X’+Y’)(Y+Y’)
= X’+Y’ = (XY)’

So, our expression reduces to that of a NAND Gate logic (Not of AND).
CIRCUIT DIAGRAM:
CIRCUITS PREPARED
OR GATE:

AND GATE:
NOT GATE:

NAND GATE:
OBSERVATIONS
Stimulation of OR gate:
The following conclusions can be easily drawn from the working of
electrical circuit:
i. If switch A and B open then (A=0, B=0) Lamp does not glow hence
Y=0

ii. If switch A open B closed then (A=0, B=1) Lamp glow, hence Y=1

iii. If switch A closed B open then (A=1, B=0) Lamp glow, hence Y=1

iv. If switch A & B are closed then (A=1, B=1) Lamp glow, hence Y=1

Stimulation of AND gate:


The following conclusions can be easily drawn from the working of
electrical circuit:
i. If both switches A and B are open (A=0, B=0) then lamp will not
glow, hence Y=0.
ii. If Switch A closed and B open (A=1, B=0) then Lamp will not glow,
hence Y =0.
iii. If switch A open and B closed (A=0, B=1) then Lamp will not glow,
hence Y=0.
iv. If switch A and B both closed (A=1, B=1) then Lamp will glow,
hence Y =1.
Stimulation of NOT gate:

The following conclusions can be easily drawn from the working of


electrical circuit:
i. If switch A is open (i.e. A=0), the lamp will glow, hence Y=1.
ii. If Switch A is closed (i.e. A=1), the lamp will not glow, hence Y=0.

Stimulation of NOR gate:


The following conclusions can be easily drawn from the working of
electrical circuit:
i. If Switch A & B open (A=0, B=0) then Lamp will glow, hence Y=1.
ii. If Switch A closed & B open (A=1, B=0) then Lamp will not glow,
hence Y =0.
iii. If Switch A open & B close (A=0, B=1) then Lamp will not glow,
hence Y=0.
iv. If switch A& B are closed then (A=1, B=1) Lamp will not glow,
hence Y=0.

Stimulation of NAND gate:


The following conclusions can be easily drawn from the working of
electrical circuit:
i. If Switch A & B open (A=0, B=0) then Lamp will glow, hence Y=1.
ii. If Switch A open B closed then (A=0, B=1) Lamp glow, hence Y=1.
iii. If switch A closed B open then (A=1, B=0) Lamp glow, hence Y=1.
iv. If switch A & B are closed then (A=1, B=1) Lamp will not glow,
hence Y=0.
RESULT
Basic logic gates were designed and simulated and logic circuit
was prepared for the given truth table.

BIBLIOGRAPHY:
 NCERT Physics Textbook
 Pdfslide.net
 Wikipedia
 Slideshare.net
 Icbse.com

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy