Boolean Algebra Flashcards

(26 cards)

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

What is Boolean algebra?

A

A mathematical system for manipulating logical variables that take values TRUE (1) or FALSE (0).

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

What are the primary Boolean operations?

A

AND (·), OR (+), and NOT (¬).

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

What is the order of precedence in Boolean operations?

A

NOT (¬) has the highest precedence, followed by AND (·), then OR (+).

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

What is the identity law for AND?

A

A · 1 = A

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

What is the identity law for OR?

A

A + 0 = A

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

What is the null law for AND?

A

A · 0 = 0

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

What is the null law for OR?

A

A + 1 = 1

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

What is the idempotent law for AND?

A

A · A = A

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

What is the idempotent law for OR?

A

A + A = A

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

What is the inverse law for AND?

A

A · ¬A = 0

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

What is the inverse law for OR?

A

A + ¬A = 1

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

What is the commutative law for AND?

A

A · B = B · A

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

What is the commutative law for OR?

A

A + B = B + A

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

What is the associative law for AND?

A

(A · B) · C = A · (B · C)

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

What is the associative law for OR?

A

(A + B) + C = A + (B + C)

17
Q

What is the distributive law of AND over OR?

A

A · (B + C) = A · B + A · C

18
Q

What is the distributive law of OR over AND?

A

A + (B · C) = (A + B) · (A + C)

19
Q

What is the absorption law for AND?

A

A · (A + B) = A

20
Q

What is the absorption law for OR?

A

A + (A · B) = A

21
Q

What is De Morgan’s first law?

A

¬(A · B) = ¬A + ¬B

22
Q

What is De Morgan’s second law?

A

¬(A + B) = ¬A · ¬B

23
Q

What is the double negation law?

24
Q

What are the basic logic gates?

A

AND, OR, and NOT gates.

25
What are derived logic gates?
NAND, NOR, XOR, and XNOR gates, which are combinations of the basic gates.
26
How are Boolean expressions implemented in hardware?
Through logic circuits composed of interconnected logic gates corresponding to the operations in the expression.