0% found this document useful (0 votes)
31 views24 pages

LOGIC GATES CLASS 12 Project

This document is a physics investigatory project by Siddharth Mathavan K on the topic of logic gates, submitted for the AISSCE 2023-2024. It includes a bonafide certificate, acknowledgments, an index, and detailed sections on various types of logic gates such as AND, OR, NOT, NAND, NOR, XOR, and XNOR, along with their principles, constructions, and truth tables. The conclusion emphasizes the importance of logic gates in digital electronics and their role in modern computing.
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)
31 views24 pages

LOGIC GATES CLASS 12 Project

This document is a physics investigatory project by Siddharth Mathavan K on the topic of logic gates, submitted for the AISSCE 2023-2024. It includes a bonafide certificate, acknowledgments, an index, and detailed sections on various types of logic gates such as AND, OR, NOT, NAND, NOR, XOR, and XNOR, along with their principles, constructions, and truth tables. The conclusion emphasizes the importance of logic gates in digital electronics and their role in modern computing.
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/ 24

SIDDHARTH MATHAVAN K

XII-A

BIOLOGY

1|P age
BONAFIDE CERTIFICATE

This is to certify that the Physics investigatory project on the topic


LOGIC GATES has been completed by SIDDHARTH MATHAVAN K
of class XII-A Roll No: 12110 at FIITJEE GLOBAL SCHOOL
Vengambakkam for the partial fulfilment of this project as a part of all
India Senior School Certificate examination CBSE, New Delhi for the
academic year 2023-2024.

DATE:

Signature of Principal: Signature of Guide:

Submitted for AISSCE 2023-2024 Physics Practical examination held


on

INTERNAL EXAMINER EXTERNAL EXAMINER

2
ACKNOWLEDGEMENT

I hereby express my heartfelt thanks to principal Mrs.S.MOHANA Priya for


permitting me to do the project in the physics laboratory and for her constant
encouragement.

I extend my gratitude to acknowledge my sense of gratitude to my physics


teacher Mr. DEEPAK KARANAM, PGT Physics for the valuable guidance
offeredto me. His wholehearted encouragement and constant stimulant
inspirationand advice enabled me to complete the project successfully.

I am also thankful to all our teachers and non-teaching staff for their help
during my course of study.

I take this opportunity to express my sincere thanks to my parents for their


encouragement and support.

3
INDEX

SNO CONTENT PAGE NO


1. INTRODUCTION 5
2. PRINCIPLE 6
3. BASIC GATES AND USES 7
4. THE AND GATE 9
5. THE OR GATE 11
6. THE NOT GATE 13
7. THE NOR GATE 15
8. THE NAND GATE 17
9. THE EX-OR GATE 19
10. THE EX-NOR GATE 21
11. CONCLUSION 23
12 BIBLIOGRAPHY 24

4
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 stops it.

The logic gates are building blocks of 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 truth table is a concise representation of all


possible combinations of input values and their corresponding output
in a logical expression or circuit. It shows the output (true or false) for
each combination of input values, providing a clear overview of the
logical relationships in a system.

BOOLEAN ALGEBRA: Boolean algebra is a mathematical


structure that deals with binary variables and logical operations
(AND, OR, NOT), allowing the manipulation and analysis of logical
expressions.

BOOLEAN EXPRESSIONS: A Boolean expression is a


mathematical expression that evaluates to either true or false, typically
involving variables, logical operators (AND, OR, NOT), and
parentheses.

5
PRINCIPLE
Any Boolean algebraic operation can be linked to input and output,
embodying the principles of Boolean algebra.

Devices like a P-N junction diode, a resistance and an N-P-N


transistor.

We have three main Logic gates from which other Logic Gates can be
made. They are:
 AND Gate
 NOT Gate
 OR Gate

LOGICAL STATEMENTS:

YES NO
TRUE FALSE
1 0
CLOSE OPEN
CONDUCTING NON-CONDUCTING
HIGH LOW
RIGHT WRONG
POSITIVE NEGATIVE

6
BASIC GATES
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 output. 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.

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 . In
Boolean algebra, multiplication sign is referred as the AND.

The Boolean expression: A.B=Y o r A X B=Y


This indicates that Y equals to A and B.

7
NOT GATE: It is a device that inverts the inputs. The NOT has
one input and has one output. In Boolean algebra, the bar symbol is
referred to as the NOT.
The Boolean expression: Y = A-
This indicates that Y is not equal to A. Here, the overline (A‾)
represents the complement or negation of A. In other words, if A is
true (1), then A ‾ is false (0), and vice versa. The NOT gate simply
inverts the input signal.

USES OF LOGIC GATES:


1. Security Systems
2. Basic Arithmetic Operations
3. Digital Signal Processing
4. Memory Unit
5. Multiplexers and Demultiplexers

8
THE AND GATE

AIM: To Design and Simulate the AND Gate circuit.


APPARATUS: Two Ideal P-N junction Diode and resistance R
THEORY AND CONSTRUCTION:
An electronic circuit implementing an AND gate utilizes two diodes,
D1 and D2. The resistance R is consistently linked to the positive
terminal of a 5V battery. In this setup, the battery's negative terminal
is connected to the ground, representing the 0 level, while the positive
terminal signifies level 1. The voltage at point C concerning the
ground serves as the output Y.

CONCLUSIONS DRAWN:
1. If switches A and B remain open (A=0, B=0), the bulb does not
illuminate, resulting in Y=0
2. If switches A and B remain open (A=0, B=0), the bulb does not
illuminate, resulting in Y=0
3. If switch A is open and B is closed (A=0, B=1), the bulb does
not shine, resulting in Y=0

9
4. However, when both switches A and B are closed (A=1, B=1),
the bulb illuminates, resulting in Y=1.

TRUTH TABLE:

INPUT A INPUT B OUTPUT


0 0 0
0 1 0
1 0 0
1 1 1
In symbols, AND gate output can be represented as:
Q=A⋅B
where: Q is the output: A,B etc, are the inputs

10
THE OR GATE
AIM: To design and simulate the OR gate circuit
APPARATUS: Two ideal P-N junction diode
THEORY AND CONSTRUCTION:
An electronic circuit implementing an OR gate can be constructed
using two diodes, D1 and D2. In this setup, the negative terminal of
the battery is connected to the ground, representing the 0 level, while
the positive terminal corresponds to level 1. The output Y is the
voltage at point C about the ground.

CONCLUSIONS DRAWN:
(i) When switches A and B are in the open position (A=0,
B=0), the bulb remains unlit, resulting in Y=0.
(ii) (ii) If switch A is closed while B is open (A=1, B=0), the
bulb illuminates, leading to Y=1.
(iii) In the scenario where switch A is open and B is closed

11
(A=0, B=1), the bulbs emit light, resulting in Y=1.
(iv) If both switches A and B are closed (A=1, B=1), the bulb
lights up, and the output is Y=1

TRUTH TABLE:
INPUT A INPUT B OUTPUT
0 0 0
0 1 1
1 0 1
1 1 1
In an OR gate, the output is 1 (high) if at least one of the inputs is 1.
The only case where the output is 0 (low) is when both inputs are 0.

12
THE NOT GATE
AIM: To design and simulate the NOT gate.
APPARATUS: An Ideal n-p-n transistor
THEORY AND WORKING: Using diodes alone does not allow
the implementation of a NOT gate. Instead, a NOT gate can be
constructed by employing an electronic circuit with an n-p-n
transistor. In this setup, the input A is linked to the transistor's base
through a resistance Rb, while the emitter is connected to the ground.
The collector is then attached to a 5V battery. The output Y
corresponds to the voltage at point C concerning the ground.

CONCLUSIONS DRAWN:
1. When the switch A is in the open position (A=0), the bulb
illuminates, resulting in Y=1.
2. Conversely, when the switch A is in the closed position
(A=1), the bulb does not illuminate, leading to Y=0.

13
TRUTH TABLE:

INPUT (X) OUTPUT (Y)

0 1

1 0

In other words, the output Y is the complement or negation of


the input A. If A is true (1), then Y is false (0), and vice
versa. This logical operation is often represented by an
inversion bar over the variable, as shown in the expression
above.

14
THE NOR GATE
AIM: To design and Simulate the NOR gate
APPARATUS: Two ideal p-n junction diodes and a n-p-n
transistor.

THEORY AND CONSTRUCTION:


By linking the output Y of an OR gate to the input of a NOT gate, we
create a NOR gate. The resulting output Y corresponds to the voltage
at point C relative to the ground.

Boolean Expression:

15
CONCLUSIONS DRAWN:
(i) When both switches A and B are open (A=0, B=0), the bulb
glows, resulting in Y=1.
(ii) If switch A is closed and switch B is open (A=1, B=0), the
bulb glows, leading to Y=0.
(iii) When switch A is open and switch B is closed (A=0, B=1),
the bulb does not glow, resulting in Y=0.
(iv) If both switches A and B are closed (A=1, B=1), the bulb
doesn’t glow, Y=0

TRUTH TABLE:

INPUT A INPUT B OUTPUT Y


0 0 1
1 0 0
0 1 0
1 1 0

16
THE NAND GATE
AIM: To design and simulate the NAND gate.
APPARATUS: Two ideal P-n Junction diodes, A resistor R and an
Ideal n-p-n transistor
THEORY AND CONSTRUCTION:
Connecting the output Y of an AND gate to the input of a NOT gate
results in the creation of a NAND gate. The resulting output Y
corresponds to the voltage at point C relative to the ground.

Boolean Expression:

17
CONCLUSIONS DRAWN:
(i) When both switches A and B are closed (A=0, B=0), the
bulb glows, resulting in Y=1.
(ii) If switch A is open and switch B is closed (A=0, B=1), the
bulb glows, leading to Y=1.
(iii) When switch A is closed and switch B is open (A=1,
B=0), the bulb glows, resulting in Y=1.
(iv) If both switches A and B are closed (A=1, B=1), then the
bulb does not glow, resulting in Y=0.

TRUTH TABLE:

INPUT A INPUT B OUTPUT Y


0 0 1
1 0 1
0 1 1
1 1 0

18
THE X-OR GATE
AIM: To design and simulate the X-OR gate circuit
APPARATUS: Two AND gates, One OR gate and Two NOT gates
THEORY AND CONSTRUCTION:
The EX-OR operation examines the exclusivity in the values of two
signals, A and B. If A and B are not identical, the output Y is set to 1;
conversely, if both are identical, the output Y is set to 0. This
operation is commonly known as the exclusive OR gate, denoted as
EX-OR.

Boolean expression:

19
CONCLUSIONS DRAWN:
1. If both switches A and B are in the open position (A=0, B=0),
the bulb does not glow, resulting in Y=0.
2. If switch A is in the open position and switch B is closed (A=0,
B=1), the bulb glows, resulting in Y=1.
3. If switch A is closed and switch B is in the open position (A=1,
B=0), the bulb will glow, resulting in Y=1.
4. If both switches A and B are closed (A=1, B=1), the bulb will
not glow, resulting in Y=0.

TRUTH TABLE:

INPUT A INPUT B OUTPUT Y


0 0 1
1 0 1
0 1 1
1 1 0

In an XOR gate, the output (Y) is true (1) when the inputs A and B
are different. If both inputs are the same, the output is false (0). This
behaviour makes XOR gates useful in various applications, such as
binary addition and error detection.

20
THE X-NOR GATE
AIM: To design and simulate the X-NOR gate circuit.
APPARATUS: Two AND gates, One OR gate and 3 NOT gates.
THEORY AND CONSTRUCTION:
The EX-NOR operation examines exclusivity in the values of two
signals, A and B. If A and B are not identical, the output Y is set to 0;
conversely, if both are identical, the output Y is set to 1. This
operation is also known as the exclusive NOR gate, designated as EX-
NOR.

Boolean Expression:

21
CONCLUSION DRAWN:
1. If both switches A and B are open (A=0, B=0), the bulb glows,
resulting in Y=1
2. If switch A is open and switch B is closed (A=0, B=1), the bulb
does not glow, resulting in Y=0
3. If switch A is closed and switch B is open (A=1, B=0), the bulb
does not glow, resulting in Y=0
4. If both switches A and B are closed (A=1, B=1), the bulb glows,
resulting in Y=1.

TRUTH TABLE:

INPUT A INPUT B OUTPUT Y


0 0 1
1 0 0
0 1 0
1 1 1
In an X-NOR gate, the output (Y) is true (1) when the inputs A and B
are identical (both 0 and both 1). If the inputs are different, the output
is false (0). The X-NOR gate is often referred to as an equivalence
gate, as it produces a true output when the inputs are equivalent.

22
CONCLUSION
In the contemporary electronic landscape, logic gates play a pivotal
role in the design and construction of numerous integrated circuits
(ICs) or microchips.

NAND gates and NOR gates hold the distinction of being labelled as
universal gates due to their capability to construct all three
fundamental gates.

The electronic world would be significantly incomplete without the


fundamental contributions of logic gates.

In summary, logic gates are indispensable in digital electronics,


providing the essential framework for designing and building
electronic circuits that form the backbone of modern computing and
communication systems.

23
BIBLIOGRAPHY

1. https://chat.openai.com
2. https://www.techtarget.com/whatis/definition/logic-gate-
AND-OR-XOR-NOT-NAND-NOR-and-XNOR
3. https://en.wikipedia.org/wiki/Logic_gate
4. Google Search Engine
5. Bing AI
6. https://www.geeksforgeeks.org/logic-gates/
7. NCERT CLASS XII Physics Part II: Chapter 14-
Semiconductors.

24

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