Chapter 4: Boolean Algebra Flashcards

1
Q

Set of rules for working with variables whose values are either 0 or 1.

A

Boolean Algebra

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

An indication of the vital role that logic plays in this field.

A

Digital Logic

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

a Boolean variable or the complement of a Boolean variable.

A

Literal
Example: x, y, z are literals

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

A product of literals.

A

Minterm
Example: xyz is a minterm

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

A Boolean expression that is a sum of products of literals is said to be

A

Disjunctive Normal Form (DNF)

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

A Boolean expression that is a product of sums of literals is said to be

A

Conjunctive Normal Form (CNF)

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

Each term that is a sum of literals is called a

A

Clause

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

Boolean expression as input and asks whether it is possible to set the values of the variables so that the expression = 1

A

Boolean satisfiability (SAT)

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

These are built from electrical devices called gates.

A

Circuits

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

Receives some number of Boolean input value and produces an output based on the values of input is called a

A

Gate

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

Three types of gates are

A

AND: multiplication
OR: addition
Inverter: complement

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

The output of the circuit depends only on the present combination of inout values and not on the state of a circuit is called

A

Combinational Circuit

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