Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
3 views13 pages

Logic Gates and Sequential Circuit - Lec 2

Uploaded by

Sridhar Ramalingam
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
3 views13 pages

Logic Gates and Sequential Circuit - Lec 2

Uploaded by

Sridhar Ramalingam
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/ 13

Std : 11th Year : 2020-21

Subject : Computer Science

Chapter : Logic Gates & Sequential Circuit

Subtopic : De-Morgan’s Theorem, Universal gates


De-Morgan’s Theorem
2
First Theorem:
• This theorem gives an equivalence between NOR and AND gate i.e. we can Replace ‘+’ by DOT .
• Theorem states :
“The NOR gate is equivalent to bubbled AND gate”
OR
“ The complement of a sum equals the product of complement”
De-Morgan’s Theorem
3
Second Theorem:
• This theorem gives an equivalence between NAND and OR gate i.e. we can Replace DOT by ‘+’ .
• Theorem states :
“The AND gate is equivalent to bubbled OR gate”
OR
“ The complement of a product equals the sum of complement”
Why NAND/ NOR are known as universal gates?
Proof for NAND gates
Implementation of NOT using NAND

 A NOT gate is made by joining the inputs of a NAND gate together.

A NAND A = (A.A)' = A'


Implementation of AND using NAND

Proof :
Implementation of OR using NAND

Proof :
Implementation of NOT using NOR

 A NOT gate is made by joining the inputs of a NOR gate together.

A NOR A = (A + A)' = A'


Implementation of AND using NOR

• Proof :
(A NOR A ) NOR (B NOR B)
= (A+A)' NOR (B+B)'
= [ (A+A)' + (B +B)' ]'
= (A' + B')'
= (A')' . (B')'
=A.B
Implementation of OR using NOR

Proof :
13

1/19/2021

You might also like