Log in
My Tools
Shell (Sow)
Shell (Guacamole)
Shell (Tabby)
Code Explorer
Matrix Chat
My Web Server
My Digital Portfolio
My IGIS
Proficiency Progress
Sash Awards
CEG-ID
Keys and Commands
Guacamole Keys
Emacs Keys
Magit Keys
Screen Keys
LLDB Commands
Overviews
Experiences Overview
Experiences Explorer
Topic Explorer
Curricula Assistant
Trailblazers
References
Swift Live Reference
Glossary
Common Errors
References
Code Snippets
Navigation
Experiences Overview
Google
Special Users
Authors
Guides
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
Browse properties
Boolean Algebra
From Coder Merlin
Revision as of 18:40, 16 March 2019 by
Chukwuemeka-tinashe
(
talk
|
contribs
)
(
→Background
)
(
diff
)
← Older revision
|
Latest revision
(
diff
) |
Newer revision →
(
diff
)
Jump to:
navigation
,
search
Within these castle walls be forged Mavens of Computer Science ...
— Merlin, The Coder
Logic Gate Symbols
[
edit
]
Background
[
edit
]
Formal Name
Abbreviated Name
Symbol
Gate
Truth Table
Buffer
Inputs
Outputs
A
{\displaystyle A}
Q
=
A
{\displaystyle Q=A}
0
0
1
1
Conjunction
AND
A
∧
B
{\displaystyle A\land B}
Inputs
Outputs
A
{\displaystyle A}
B
{\displaystyle B}
Q
=
A
∧
B
{\displaystyle Q=A\land B}
0
0
0
0
1
0
1
0
0
1
1
1
Disjunction
OR
A
∨
B
{\displaystyle A\lor B}
Inputs
Outputs
A
{\displaystyle A}
B
{\displaystyle B}
Q
=
A
∨
B
{\displaystyle Q=A\lor B}
0
0
0
0
1
1
1
0
1
1
1
1
Exclusive OR
XOR
A
⊕
B
{\displaystyle A\oplus B}
Inputs
Outputs
A
{\displaystyle A}
B
{\displaystyle B}
Q
=
A
⊕
B
{\displaystyle Q=A\oplus B}
0
0
0
0
1
1
1
0
1
1
1
0
Inverter
NOT
¬
A
{\displaystyle \neg A}
Inputs
Outputs
A
{\displaystyle A}
Q
=
A
¯
{\displaystyle Q={\overline {A}}}
0
1
1
0
Negated Conjunction
NAND
A
∧
B
¯
{\displaystyle {\overline {A\land B}}}
Inputs
Outputs
A
{\displaystyle A}
B
{\displaystyle B}
Q
=
A
∧
B
¯
{\displaystyle Q={\overline {A\land B}}}
0
0
1
0
1
1
1
0
1
1
1
0
Negated Disjunction
NOR
A
∨
B
¯
{\displaystyle {\overline {A\lor B}}}
Inputs
Outputs
A
{\displaystyle A}
B
{\displaystyle B}
Q
=
A
∨
B
¯
{\displaystyle Q={\overline {A\lor B}}}
0
0
1
0
1
0
1
0
0
1
1
0
Negated Exclusive OR
NOT XOR
A
⊕
B
¯
{\displaystyle {\overline {A\oplus B}}}
Inputs
Outputs
A
{\displaystyle A}
B
{\displaystyle B}
Q
=
A
⊕
B
¯
{\displaystyle Q={\overline {A\oplus B}}}
0
0
1
0
1
0
1
0
0
1
1
1
https://www.facebook.com/Coder-Merlin-101592328319584/
https://teespring.com/stores/coder-merlin
https://twitter.com/codermerlin
https://discord.gg/Hj7mTVtMbH
https://discourse.codermerlin.com/
https://openbadges.org/
Designed with pride in Silicon Valley, CA, USA