1/12
Looks like no tags are added yet.
Name | Mastery | Learn | Test | Matching | Spaced |
---|
No study sessions yet.
NOT gate(Negation)
reverses the input
AND gate (Conjunction)
takes two inputs and both inputs need to be on (have electrical current) for the output to be 1
OR gate (Disjunction)
only one of the inputs need to be on for the output to be one
boolean logic notation
V
¬
1. P = A ∨ (¬B ∧ C)
-or
-not
P= A OR (NOT B AND C)
truth table for NOT gate
truth table for AND gate
truth table for OR gate
draw truth table for this
write boolean expression for this logic gate
write boolean expression for this logic gate
write boolean expression for this logic gate
what is a truth table
Truth tables are used to show all possible inputs and the associated output for each input.
The input and output values in a truth table must be a Boolean value - usually 0 or 1 but occasionally True or False.