Save
computer science
1.4.3: Boolean algebra
Save
Share
Learn
Content
Leaderboard
Learn
Created by
Fiona Bull
Visit profile
Cards (11)
simplify
the boolean expression ¬B•(¬A+¬B)
¬B•¬A
what boolean operation is represented with ¬
NOT
which has the highest order of precedence: AND, OR, NOT
NOT
complete the boolean identity: C•C (and)
C
which boolean operation is represented with a dot? (•)
AND
simplify the following boolean expression: (C + (B + ¬B)) • D
D
complete the boolean identity: B • 1
B
Apply one of the
De Morgan's Laws
to the following Boolean expression: ¬A •
¬B
¬(
A
+ B)
which boolean operation is represented with a plus?
OR
apply one of the
De Morgan's laws
to the following boolean expression: ¬(A •
C)
¬A
+ ¬C
Apply a distributive rule to the following boolean expression: B • (A + C)
B • A + B • C