Boolean Algebra Flashcards

(31 cards)

1
Q

What is Boolean Algebra used for?

A

It is used to simplify and analyze logic circuits using binary values and logical operations.

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

What is the output of the AND operation when both inputs are 1?

A

1

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

What is the output of the OR operation when both inputs are 0?

A

0

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

What is the NOT operation of 1?

A

0

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

What is the Identity Law in Boolean algebra?

A

A + 0 = A and A · 1 = A

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

What is the Null Law (Operations with Zero and 1) in Boolean algebra?

A

A + 1 = 1 and A · 0 = 0

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

What is the Idempotent Law in Boolean algebra?

A

A + A = A and A · A = A

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

What is the Complement Law in Boolean algebra?

A

A + A′ = 1 and A · A′ = 0

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

What is the Double Negation/Involution Law in Boolean algebra?

A

(A′)′ = A

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

What is the Commutative Law in Boolean algebra?

A

A + B = B + A and A · B = B · A

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

What is the Associative Law in Boolean algebra?

A

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

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

What is the Distributive Law in Boolean algebra?

A

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

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

What does A + 0 simplify to in Boolean algebra?

A

A

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

What does A · 1 simplify to in Boolean algebra?

A

A

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

What does A + 1 simplify to in Boolean algebra?

A

1

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

What does A · 0 simplify to in Boolean algebra?

17
Q

What does A + A simplify to in Boolean algebra?

18
Q

What does A · A simplify to in Boolean algebra?

19
Q

What does A + A′ simplify to?

20
Q

What does A · A′ simplify to?

21
Q

What is the result of double complement (A′)′?

22
Q

What does A + AB simplify to?

23
Q

What does A(A + B) simplify to?

24
Q

What does A + A′B simplify to?

25
What is the first De Morgan's Theorem?
(A · B)′ = A′ + B′
26
What is the second De Morgan's Theorem?
(A + B)′ = A′ · B′
27
What is the complement of (A · B)?
A′ + B′
28
What is the complement of (A + B)?
A′ · B′
29
What is a Karnaugh Map (K-map)?
A Karnaugh Map is a graphical tool used to simplify Boolean expressions by organizing input combinations in a way that makes logical minimization easier.
30
What are the applications of a Karnaugh Map?
K-maps are used for simplifying logic circuits, minimizing the number of logic gates, designing combinational logic, error detection and correction, optimizing programmable logic devices, and simplifying state tables in sequential circuits.
31
What is De Morgan's Theorem?
De Morgan's Theorem provides rules for converting AND operations to OR operations and vice versa in complemented Boolean expressions: (A·B)' = A' + B' and (A + B)' = A'·B'.