2) Boolean Algebra and Logic Gates Flashcards
1
Q
What is Boolean Algebra?
A
Boolean algebra is a formal notation for describing logical relations. AND, OR & NOT.
2
Q
NOT Gate
A
Q = ¬A (NOT A)
Input Output
A NOT A
1 0
0 1
3
Q
AND Gate
A
Q = A . B (A AND B)
A B Q 0 0 0 0 1 0 1 0 0 1 1 1
4
Q
OR Gate
A
Q = A + B (A OR B)
A B Q 0 0 0 0 1 1 1 0 1 1 1 1
5
Q
XOR
A
Q = A ⊕ B (A XOR B) Q = (A . ̅B) + (Ā . B)
“Exclusive OR” - True when one input or the other is True, not both.
A B Q 0 0 0 0 1 1 1 0 1 1 1 0
6
Q
NOR
A
Q = (A+B) ̅ NOT (A OR B)
A B Q 0 0 1 0 1 0 1 0 0 1 1 0
7
Q
NAND
A
Q = (A.B) ̅ NOT (A AND B)
A B Q 0 0 1 0 1 1 1 0 1 1 1 0
8
Q
Order of operations
A
- Brackets
- NOT ( ̅ or ¬)
- AND, NAND ( . )
- OR, NOR, XOR ( + or ⊕)
A.B+C
(A.B)+C