1.4.3a - boolean algebra Flashcards

1
Q

What is Boolean algebra?

A

A branch of mathematics that deals with true or false values.

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

What are the basic Boolean operations?

A

AND, OR, NOT.

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

What does AND (∧) do in Boolean algebra?

A

Returns true if both operands are true.

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

What does OR (∨) do in Boolean algebra?

A

Returns true if at least one operand is true.

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

What does NOT (¬) do in Boolean algebra?

A

Inverts the value (true becomes false and vice versa).

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

What is a truth table?

A

A table that shows all possible outcomes of a Boolean expression.

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

What is a logical expression?

A

A combination of variables and operators that evaluate to true or false.

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

What is De Morgan’s law?

A

Rules that relate AND and OR operations with negation.

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

How does the AND operation behave in a truth table?

A

It’s true only when both inputs are true.

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

How does the OR operation behave in a truth table?

A

It’s true when at least one input is true.

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

What is a Boolean variable?

A

A variable that can have a value of true or false.

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

What is simplification in Boolean algebra?

A

Reducing a Boolean expression to its simplest form.

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

What is a Karnaugh map (K-map)?

A

A diagram used to simplify Boolean expressions visually.

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

What is a NAND gate?

A

A combination of an AND gate and a NOT gate (output is true unless both inputs are true).

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

What is a NOR gate?

A

A combination of an OR gate and a NOT gate (output is true only when both inputs are false).

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

What is a XOR gate?

A

A gate that outputs true only if one input is true, but not both.

17
Q

What is a truth value?

A

The result of a Boolean expression (either true or false).

18
Q

What is the complement of a Boolean variable?

A

The inverse of the variable (NOT A).

19
Q

How is Boolean algebra used in programming?

A

It helps in making decisions and controlling program flow (e.g. in IF statements).

20
Q

What is a Boolean circuit?

A

A circuit that uses gates like AND, OR, NOT to compute logical expressions.

21
Q

Why use Boolean algebra in computer science?

A

It simplifies logic in digital circuits and decision-making processes.

22
Q

How does a logic gate work in Boolean algebra?

A

It processes input values (true/false) to produce an output based on its operation.