Lesson 5 - Boolean Minimisation Flashcards
Covers Karnaugh maps and the Quine-McCluskey method
1
Q
involution is another name for what law (in propositional logic)
A
double complement law
2
Q
both annulment laws
A
A+1=1 and A.0 = 0
3
Q
both identity laws
A
A+0=A and A.1=A
4
Q
both idempotence laws
A
A+A=A and A.A=A
5
Q
both complementarity laws
A
A+A’=1 and A.A’=0
6
Q
BA + BA’ = ? (plus which law)
A
B (uniting)
7
Q
(B+A).(B+A’) = ? (plus which law)
A
B (uniting)
8
Q
BA’ + A = ? (plus which law)
A
A+B (absorption)
9
Q
A.(B+A’) = ? (plus which law)
A
AB (absorption)
10
Q
what can be used to figure out the result of a particularly complex Boolean algebraic expression?
A
circuit diagram
11
Q
A
