Scribd
Upload
13 views

physicsfinale

Uploaded by

mettalicstar88
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
13 views

physicsfinale

Uploaded by

mettalicstar88
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/ 10

INDEX

Sl no. TOPIC Page


1 ACKNOWLEDGMENT 1
2 INTRODUCTION 2
3 AND 3
4 OR 4
5 NOT 5
6 NAND 6
7 NOR 7
8 Designing logic gate 8-9
circuit
9 BIBLIOGRAPHY 10
INTRODUCTION
Logic gates is the building unit of a circuit.They work under the Boolean Function.Logic gates
carry out logical operations on single or multiple binary inputs.They give the output as binary.
For an electronic device to function a logic needs to bet set up between the input and output
voltages.
This function is done by using logic gates in the circuit.
There are five different logic gates:
1. NOT
2. AND
3. OR
4. NAND
5. NOR
6. XOR
The gates are made of semiconductors.Each logic gates are represented by a symbol along with
a truth table.The truth table gives all the possible combinations of input and output.The truth
table helps to understand the behavior of the logic gates.
Logic gates are further classified into :-
1. Basic logic gates(NOT,AND,OR)
2. Universal logic gates(NAND,NOR)
3. Exclusive logic gate(XOR)
Basic logic gates can be found in safety thermostats, automatic watering systems, light
powered alarm, etc.The logic gates usually follow De Morgan’s Law.
AND GATE
X = (A . B)

AND gate is the fundamental logic gate that executes the logical multiplication of binary input.
The AND operation is carried out in the same way as standard multiplications of 1s and 0s. An
AND gate is a logic circuit that performs AND operations on the input of the circuit. When all
the inputs are 1, the AND Gate outputs 1, otherwise it outputs 0. A dot (.) denotes the AND
operation.

OPERATIONS OF AND GATE


The expression of AND Gate is as follows –
Say we have two inputs, A and B and the output is called X, then the expression is:

SYMBOL OF AND GATE


OR GATE
X= (A+B)

OR gate is the type of Logic Gate. Let’s suppose in binary numbers 0 and 1, 0 is low and 1 is high.
So when at least one of the provided inputs is high then the output is high otherwise it’s low.

SYMBOL AND TRUTH TABLE OF OR GATE


NOT GATE
Y = Ā or Y = A’
In digital circuits, the NOT gate is a basic logic gate having only a single input and a single output.
The output of the NOT gate is logic 0 when its input is logic 1 and the output is logic 1 when its
input is logic 0. Thus, the NOT gate is used to perform the inversion operation in digital circuits.
It complements the input and produces a corresponding output

SYMBOL AND TRUTH TABLE OF NOT GATE


UNIVERSAL GATES
A universal gate is a gate which can implement any Boolean function
without need to use any other gate type. The NAND and NOR gates
are universal gates. In practice, this is advantageous since NAND and
NOR gates are economical and easier to fabricate and are the basic
gates used in all IC digital logic families.
NAND GATE
X = (A . B)’
NAND gate, also known as Not-AND gate, does the exact opposite or complement of the AND gate.

Returns 1, if all the inputs are 0 or alternative (meaning one is 0, and the other is 1 or vice versa).

Returns 0, if all inputs are 1.

SYMBOL AND TRUTH TABLE OF NAND GATE


NOR GATE
X =(A + B)’
NOR gate is a digital logic gate that performs NOR operation between two or more binary inputs and
output binary signal. This is a combination of OR gate and NOT gate.

NOR gate, is considered as a Universal gate, which is opposite or complement of OR gate.

Returns 1, if all the inputs are 0

Returns 0, if any of the input is 1, or all of the inputs are 1.


DESIGN A LOGIC GATE COMBINATION FOR GIVEN TRUTH TABLE.

A B C Final output calculation

0 0 0 1 (A)’.(B)’.(C)’

0 0 1 0

0 1 0 0

0 1 1 1 (A)’.B.C

1 0 0 0

1 0 1 1 A.(B)’.C

1 1 0 1 A.B.(C)’

1 1 1 0

1. For each row which has 1 as final output, we write complement of the element if it is 0, if it
is one we don’t make any changes.
2. input all the values into and gate.
3. Then input all the values we get after step 2 into or gates.
The resultant circuit:
BIBLIOGRAPHY

Geeks for Geeks. Introduction to Logic Gates

Wikipedia. Logic gate

Electronics-tutorials. Universal logic gates

Chegg. The boolean expression for the following


truth table.

Circuitverse. Logic Circuit Simulator

You might also like