Boolean logic and algebra Flashcards

You may prefer our related Brainscape-certified flashcards:
1
Q

Boolean logic for AND, OR and NOT

A

AND = A.B
OR = A+B
NOT = Ā

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Why would you simplify circuits

A

Less logic gates means simpler circuits meaning cheaper designs and cheaper processers etc.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

How can you simplify circuits

A

Using algebra or truth tables

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

List all 8 Boolean algebraic identifiers

A

0+A = A

1+A = 1

A+A = A

A+Ā = 1

0.A = 0

1.A = A

A.A = A

A.Ā = 0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Algebraic Boolean properties
Commutative
Associative
Distributive

A

Commutative:
A.B = B.A
A+B = B+A

Associative:
A . (B.C) = (A.B) . C
A + (B + C) = (A + B) + C

Distributive:
A . (B + C) = A.B + A.C
(A + B) . (A + C) = A + B.C

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

1) A.B + Ā.B
2) Ā + B.Ā
3) Ā . (A + B)
4) B. (A + A.B)
5) (A + A) . (A + B)

A

1) B
2) Ā
3) Ā.B
4) A.B
5) A

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Simple way to remember De Morgan’s Law

A

Break the line; change the sign

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What is the order of precedence

A

B.N.A.O
Brackets, Not, And, Or

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

How to simplify Boolean algebra

A
  1. Identify any NOR or NAND
  2. Use De Morgan’s’ law
How well did you know this?
1
Not at all
2
3
4
5
Perfectly