ppt of digital electronics of logic gate

1. MEWAR UNIVERSITY
TOPIC :- LOGIC GATE
SUBMITTED TO:-
MR. GAURAV
SHARMA
DEPT. OF ECE
SUBMITTED BY:-
AJAY KUMAR DAS
COURSE :- B.TECH
(2nd year)
MUR1800226

2. CONTENTS
� INTRODUCTION OF LOGIC GATE
� BASIC GATE
*AND GATE
* OR GATE
* NOT GATE
� UNIVERSAL GATE
*NAND GATE
* NOR GATE
� EXCLUSIVE OR GATE
� EXCLUSIVE NOR GATE

3. LOGIC GATE
� A logic gate is a building of a digital circuit.
� Logic gates have two inputs and one output and based on
Boolean algebra.
� At any given moment ,every terminal is in one of the two
binary conditions false(low) or true(high).
� False represents 0 and true represents 1.
� These gates are AND, OR, NOT, NOT, NAND, NOR
EXOR and EXNOR.

4. AND GATE
� The AND gate has the following symbol and truth
table.
� Two or more input bits produces one output bit.
� Both inputs must be true (1) for the output to be
true.
� Otherwise the output is false (0).
A
B
Y
INPUTS
OUTPUT
A B Y=A.B
0 0 0
0 1 0
1 0 0
1 1 1
Y= A.B
(a)Circuit
symbol
(b) Truth table
(c)Boolean
algebra

5. OR GATE
� An OR gate is a digital logic gate with two or
more inputs and one output that performs logical
disjunction.
� The output of an OR gate is true (1) when one or
more of its inputs are true.
� If all inputs are false (0) then its output is false
A
B Y
INPUTS OUTP
UT
A B Y=A+B
0 0 0
0 1 1
1 0 1
1 1 1
Y = A+B
(a) Circuit symbol
(b) Truth table
(c) Boolean algebra

6. NOT
GATE
� The simplest possible gate is called an “inverter” or
NOT gate.
� One bit as input produces its opposite as output .
� The symbol for NOT gate is shown below.
A Y=A
INPUT OUTPUT
A Y
0 1
1 0
Y = A
(a) Circuit symbol
(b) Truth table
(c) Boolean
algebra

7. NAND GATE
� The NAND gate is a combination of an AND
gate and NOT gate
� NAND gate is also called universal gate
� NAND gate produces an output is false only if
all inputs are true
A
B Y
INPUTS OUPUT
A B Y = AB
0 0 1
0 1 1
1 0 1
1 1 0
Y = AB
(a) Circuit
symbol
(b) Truth table
(c) Boolean
algebra

8. NOR GATE
� The NOR gate is combination of an OR gate and a NOT
gate.
� A high output (1) if both inputs are low(0)
inputs output
A B Y
0 0 1
0 1 0
1 0 0
1 1 0
Y = A+B
(a) Circuit
symbol
(b) Truth table
Boolean
algebra
A
B Y

9. EX- OR GATE
� Exclusive or gate are true if either input is true
but not both.
� Output will be high (1) for different inputs and
output is low (0) for same inputs.
� The symbol and truth table shown below.
INPUTS OUTPUT
A B Q
0 0 0
0 1 1
1 0 1
1 1 0
Q = A ⊕ B
(a) Circuit
symbol
(b) Truth table
Boolean
algebra

10. EX- NOR GATE
� Output will be high (1) for same inputs and output
will be low (0) for different input.
� The symbol and truth table is shown below.
inputs output
A B Q
0 0 1
0 1 0
1 0 0
1 1 1
Q = A ⊕ B
(a) Circuit symbol
(b) Truth table
(c) Boolean
algebra

11. THANK
YOU