SLR 15 Flashcards
What are the two De Morgan laws in Boolean algebra
¬(A ^ B) = ¬A v ¬B
¬(A v B) = ¬A ^ ¬B
What are the 8 basic laws of Boolean Algebra
X ^ TRUE = X
X ^ FALSE = FALSE
X ^ X = X
X ^ ¬X = FALSE
X v TRUE = TRUE
X v FALSE = X
X v X = X
X v ¬X = TRUE
How to represent the logical operators
¬ = NOT
v = OR
^ = AND
What are the commutativity rules in Boolean algebra
X v Y = Y v X
X ^ Y = Y ^ X
What are the associativity rules in Boolean algebra
(X v Y) v Z = X v (Y v Z)
(X ^ Y) ^ Z = X ^ (Y ^ Z)
What are the distributivity rules in Boolean algebra
A ^ (B v C) = (A ^ B) v (A ^ C)
A v (B ^ C) = (A v B) ^ (A v C)
What are the absorbtion rules in Boolean algebra
X v (X ^ Y) = X
X ^ (X v Y) = X
What is double negation in Boolean algebra
¬¬X = X
What mathematical operators can be used to represent the Boolean operators?
- == AND
+ == OR
+ == XOR (kinda)
What does DNF stand for in Boolean algebra and what does it mean?
Disjunctive normal form, AND expressions joined by ORs
What does CNF stand for in boolean algebra and what deos it mean
Conjunctive normal form, OR expressions joined by ANDs
What is an Adder in boolean algebra
Logic gate circuitry for adding two values.
What is the difference between half- and full-adders?
Half adders do not take into account the previous “carry” bit from other calculations, whereas full-adders do.
What is a Flip-Flop in boolean logic
The building block for almost all memory devices, can store one bit and toggle 0–>1, 1–>0
