Professional Documents
Culture Documents
Logic Gates
Logic Gates
Upload a Document
Search Books, Presentations, Business, Academics...
Explore
Yash Rajput
Welcome to Scribd - Where the world comes to read, discover, and share...
We’re using Facebook to give you reading recommendations based on what your friends are sharing and the things
you like. We've also made it easy to connect with your friends: you are now following your Facebook friends who are
on Scribd, and they are following you! In the future you can access your account using your Facebook login and
password.
/ 13
Search w ithin do
Reading should be social! Post a message on your social networks to let others know what you're reading. Select the sites
below and start sharing.
Link account
Readcast this Document
Download this Document for Free
Y
A
OU
TPU
T
INP
UT
10
10
TR
UT
H
TA
BLE
A
Y=A
If
INP
UT
is
high
then
the
OU
TPU
T is
high
.If
INP
UT
is
low
then
the
OU
TPU
T is
low.
BUFFER Gate
BUFFER Gate
TR
UT
H
TA
BLE
NAND Gate
NAND Gate
If at
least
one
ofth
e
INP
UT
is
low
then
the
OU
TPU
T
is
high
.
Y
B
A0
0
1
0
1
1
1
0
1
1
1
0
OU
TP
UT
INP
UTAB
Y=A.B
TR
UT
H
TA
BLE
NOR Gate
NOR Gate
If
both
of
the
INP
UTs
are
low
then
the
OU
TPU
T is
high
.
Y
B
A0
0
1
0
1
0
1
0
0
1
1
0
OU
TP
UT
INP
UTAB
Y=A+B
If
allth
e
INP
UTs
aren
’t
equa
l
then
the
OU
TPU
T is
high
.
Y
B
A0
0
0
0
1
1
1
0
1
1
1
0
OU
TP
TR
UT
H
TA
BLE
XOR Gate
XOR Gate
AB
Y=A+B
UT
INP
UT
If
allth
e
INP
UTs
are
equa
l
then
the
OU
TPU
T is
high
.
Y
B
A0
0
1
0
1
0
1
0
0
1
1
1
OU
TP
TR
UT
H
TA
BLE
XNOR Gate
XNOR Gate
AB
Y=A+B
UT
INP
UT
SUMMARY
SUMMARY
Whe
re A
&B
are
INP
UTs
and
Y is
OU
TPU
T.
NO
T
Gate
Y=
A
BUF
FER
Gate
Y=
A
XN
OR
Gate
Y=
A+B
NO
R
Gate
Y=
A+B
OR
Gate
Y=
A+B
XO
R
Gate
Y=
A+B
NA
ND
Gate
Y=
A.B
AN
D
Gate
Y=
A.B
Logic Gates Ppt
Download this Document for FreePrintMobileCollectionsReport Document
Info and Rating
and
information
language
Computer
Or
Basic
About
Assembly
Circuit
buffer
nand
XOR
nor
summery
logic gates
(more tags)
rasikalb
Ads by Google
PreviousNext
1.
1 p.
7 p.
1 p.
2.
2 p.
14 p.
9 p.
3.
29 p.
54 p.
24 p.
4.
4 p.
281 p.
1 p.
5.
1 p.
p.
3 p.
6.
1 p.
1 p.
1 p.
7.
2 p.
2 p.
25 p.
8.
3 p.
15 p.
9 p.
9.
p.
1 p.
2 p.
10.
64 p.
11 p.
14 p.
11.
p.
32 p.
3 p.
PreviousNext
1.
13 p.
Recent Readcasters
Add a Comment
This document has made it onto the Rising list!
05 / 22 / 2010
dharampaljaat left a comment
nice for every one
02 / 26 / 2010
mrapurva left a comment
thanks alot for this gr8 tutorial on GATES
02 / 11 / 2010
0000b1d47 left a comment
plz tell me abt circuits of gates and tell me how we can make circuits using truth table.
09 / 09 / 2009
Upload a Document
Follow Us!
scribd.com/scribd
twitter.com/scribd
facebook.com/scribd
About
Press
Blog
Partners
Scribd 101
Web Stuff
Scribd Store
Support
FAQ
Developers / API
Jobs
Terms
Copyright
Privacy