Scribd
Upload
12 views54 pages

Ch 2 _logic Gates

The document provides an overview of Boolean algebra, logic gates, and their applications in digital circuits. It explains basic gates (AND, OR, NOT) and derived gates (NAND, NOR, XOR, XNOR), emphasizing the significance of NAND and NOR gates as universal building blocks. Additionally, it covers De Morgan's theorems, truth tables, and practical applications such as parity testers and adders.

Uploaded by

hapra.reg
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
12 views54 pages

Ch 2 _logic Gates

The document provides an overview of Boolean algebra, logic gates, and their applications in digital circuits. It explains basic gates (AND, OR, NOT) and derived gates (NAND, NOR, XOR, XNOR), emphasizing the significance of NAND and NOR gates as universal building blocks. Additionally, it covers De Morgan's theorems, truth tables, and practical applications such as parity testers and adders.

Uploaded by

hapra.reg
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 54

CH 2: LOGIC GATES BY

Mugdha Kulkarni
(15%) Ast.teacher (fc jr wing)
BOOLEAN ALGEBRA
Definition: Boolean algebra is division of mathematics that deals with operations on
logical values and incorporates binary values.
The distinguishing factor of Boolean algebra is that it deals with the study of
binary variables.
The possible values are 1(true ) and 0 (false)
LOGIC LEVELS IN BOOLEAN
ALGEBRA
Logic
levels
Positive Negativ
logic e logic
Logic design: The interconnection of gates to
perform a variety of logical operations is called logic
design.
Logic gates: A logic gate is a simple switching
circuit that determines whether an input pulse can pass
through to the output circuit. Gate is a logic circuit with
one or more input signals but only one output. Total
number of combinations for a gate is 2^n where , n is
the number of inputs.
Truth table: a table which lists all the possible
Logic
gates
Deriv
Basic
ed
gates
gates

AND OR NOT NAND NOR XOR XNOR


BASIC GATES : THE GATES WHICH
ARE USED TO PERFORM ALL BASIC
FUNCTIONS IN THE MATHEMATICS
AND GATE (MULTIPLICATION)

OR GATE( ADDITION)

NOT GATE (INVERSION)


AND GATE (MULTIPICATION )
OR GATE (ADDITION)
NOT GATE (INVERSION)
PINOUTS OF BASIC GATES
QUESTIONS :
 Comment on Boolean algebra.
Explain positive and negative logic with
examples.
Define Gate. State the types of basic and
derived gates.
Explain basic gates with definition , symbol ,
logic equation and truth table.
DERIVED GATES
NAND GATE (AND + NOT )

NOR GATE (OR + NOT )

EXOR GATE (AND + OR + NOT)

EXNOR GATE (AND + OR + NOT)


NAND GATE (COMBINATION
OF AND + NOT)
NOR GATE (OR + NOT)
UNIVERSAL GATES/
UNIVERSAL BUILDING
BLOCKS
 NAND GATE & NOR GATES ARE CALLED AS A
UNIVERSAL GATES.
ALL BASIC GATES THAT IS AND , OR & NOT
GATES CAN BE BUILD USING THESE NAND , NOR
GATES . WE CAN DEVELOP THE LOGIC OF BASIC
GATES USING THESE DERIVED GATES.
NOT GATE USING NAND
GATE
AND USING NAND
OR GATE USING NAND GATE
AND , OR , NOT GATE USING
NOR GATE
EXCLUSIVE OR GATE (EX-OR /
XOR)
The xor gate has two or more
inputs and one output signal.
Two input xor gate consists of 2
and gates , 2 not gates and 1 or
gate.
The xor gate is a logic circuit
which has a high output when it
has odd number of high inputs or
when its inputs are not same for
two input xor gate.
DIFFERENCE BETWEEN INCLUSIVE OR GATE AND EXCLUSIVE OR GATE

INCLUSIVE OR GATE EXCLUSIVE OR GATE


1. If any input is high , the output is high 1. It has a high output when it has odd
number of high inputs.
2. Logic equation: Y= A+B 2. Logic equation : Y = A (mod 2) B
3. LOGIC SYMBOL: 3. LOGIC SYMBOL:

4. TRUTH TABLE:
ASSIGNMENT NO : 2
1. Why NAND and NOR gates are called as
universal building blocs?
2. Explain NAND gate as a universal building
block.
3. Explain NOR gate as a universal building
block.
4. Write a short note on Exclusive OR gate .
5. Write the difference between inclusive OR
and Exclusive OR gate.
BOOLEAN LAWS AND
THEORMS
DE MORGAN'S THEOREM
STATEMENT: The complement of the sum of two or more variables is
equal to the product of the complement of the variables.

STATEMENT: The complement of the product of two or more variables is


equal to the sum of the complement of the variables.
TRUTH TABLE:
PROBLEM
DRAW A LOGIC CIRCUIT AND WRITE OUTPUTS IN BOOLEAN FORM USING
LOGIC GATES FOR THE FOLLOWING SITUATION. A RED LAMP SHOULD
GLOW WHEN TWO OF THE THREE OPERATIONS ARE TAKING PLACE AND
THE YELLOW LAMP SHOULD GLOW WHEN NONE OF THE THREE
OPERATIONS IS CARRIED OUT.
ASSIGNMENT NO : 3
1. Explain De Morgan’s theorems in detail.
2. Draw logic diagram for De Morgan’s theorems using NAND gates
3. Draw logic diagram for following equations.
a)
b) +A
4. Simplify :
a) Y= A B C + A B C + B C D b) ( A+B) (A+ B) (A+C )
8 BIT CONTROLL INVERTER
APPLICATIONS OF EXOR
GATE
1 PARITY TESTER: A GROUP OF BITS OR WORD CAN HAVE EVEN OR ODD
PARITY . EVEN PARITY MEANS A WORD HAS AN EVEN NUMBER OF 1’S.
ODD PARITY MEANS A WORD HAS AN ODD NUMBER OF 1’S.
4 BIT PARITY
HALF ADDER : HALF ADDER IS A LOGIC
CIRCUIT THAT ADDES 2 BINARY DIGITS AT A TIME .
FULL ADDER:
4 BIT BINARY ADDER
4 BIT BINARY
ADDER/SUBTRACTOR
ASSIGNMENT N0 : 4
1. Write a short note on control inverter. Explain with 8 bit
control inverter.
2. Explain 4 bit parity tester with logic diagram and truth
table .
3. Explain half adder with logic diagram ,equation and truth
table.
4. Explain full adder with logic diagram , equation and truth
table .
5. Explain 4 bit binary adder.
6. Explain 4 bit binary adder/ subtractor.

You might also like