Deck 5: Boolean Circuits

Question 1

Use the following truth table to complete the exercises.
Write the boolean expression in dnf.

Answer 1

ABC ∨ A′BC ∨ A′BC′

Question 2

Name the property demonstrated in each Boolean variable expression.

Answer 2

Distributive property of AND over OR

Question 3

Sketch the gated circuits associated with each of the following Boolean expressions.

Answer 3

Question 4

Simplify each of the following Boolean expressions.

Question 5

Sketch the switching circuit associated with each of the following Boolean expressions.

Question 6

Question 7

Write each of the Boolean functions as a Boolean expression in dnf, and then sketch the
switching circuit for the expression.
Write the Boolean expression for the following switching
circuit, then sketch the equivalent truth table.

Question 8

Use real variable algebra to simplify the following expressions.

Question 9

Use Boolean algebra to simplify the following expressions, and then evaluate the expressions
for x = 0 and y = 1.

Question 10

Sketch the switching circuit associated with each of the following Boolean expressions.

Question 11

Write each of the Boolean functions as a Boolean expression in dnf, and then sketch the
switching circuit for the expression.

Question 12

Use Boolean algebra to simplify the following expressions, and then evaluate the expressions
for x = 0 and y = 1.

Question 13

Simplify each of the following Boolean expressions.

Question 14

Sketch the gated circuits associated with each of the following Boolean expressions.
Write the reduced expression for the following Karnaugh map.

Question 15

Sketch the gated circuits associated with each of the following Boolean expressions.
Sketch the Karnaugh map for the Boolean expression , and then use it to find
an equivalent reduced expression.

Question 16

Sketch the gated circuits associated with each of the following Boolean expressions.
Give the Boolean expression associated with the following gated
circuit.

Question 17

Name the property demonstrated in each Boolean variable expression.

Question 18

Write each of the Boolean functions as a Boolean expression in dnf, and then sketch the
switching circuit for the expression.

Question 19

Use real variable algebra to simplify the following expressions.

Question 20

Sketch the gated circuits associated with each of the following Boolean expressions.

Question 21

Sketch the gated circuits associated with each of the following Boolean expressions.

Question 22

Write each of the Boolean functions as a Boolean expression in dnf, and then sketch the
switching circuit for the expression.

Question 23

Use the following truth table to complete the exercises.
Construct a Karnaugh map for this expression and find an
equivalent reduced expression.

Question 24

Simplify each of the following Boolean expressions.

Question 25

Use the following truth table to complete the exercises.
Sketch the switching circuit that is equivalent to the Boolean expression.

Question 26

Use Boolean algebra to simplify the following expressions, and then evaluate the expressions
for x = 0 and y = 1.

Question 27

Name the property demonstrated in each real variable expression.

Question 28

Sketch the switching circuit associated with each of the following Boolean expressions.

Question 29

Use real variable algebra to simplify the following expressions.

Question 30

Simplify each of the following Boolean expressions.

Question 31

Name the property demonstrated in each real variable expression.

Question 32

Write each of the Boolean functions as a Boolean expression in dnf, and then sketch the
switching circuit for the expression.
Write the Boolean expression for the following switching
circuit, then sketch the equivalent truth table.

Question 33

Name the property demonstrated in each real variable expression.

Question 34

Name the property demonstrated in each real variable expression.

Question 35

Use real variable algebra to simplify the following expressions.

Question 36

Write each of the Boolean functions as a Boolean expression in dnf, and then sketch the
switching circuit for the expression.

Question 37

Use the following truth table to complete the exercises.
Sketch the Venn diagram that is equivalent to the Boolean expression.

Question 38

Use Boolean algebra to simplify the following expressions, and then evaluate the expressions
for x = 0 and y = 1.

Question 39

Sketch the switching circuit associated with each of the following Boolean expressions.

Question 40

Use the following truth table to complete the exercises.
Sketch the gated circuit that is equivalent to the reduced expression.

Question 41

Sketch the gated circuits associated with each of the following Boolean expressions.
Sketch the Karnaugh map for the Boolean expression
AB′C ∨ AB′C′ ∨ A′BC ∨ A′BC′, and then use it to find
an equivalent reduced expression.

Question 42

Use the following truth table to complete the exercises.

(a) Associative
(b) Commutative
(c) Identity
(d) Distributive
(e) None of these

Question 43

Use real variable algebra to simplify the following expressions.

Question 44

Use the following truth table to complete the exercises.
Sketch the switching circuit that is equivalent to the Boolean expression.

Question 45

Use the following truth table to complete the exercises.
Sketch the Venn diagram that is equivalent to the Boolean expression.

Question 46

Name the property demonstrated in each Boolean variable expression.

(a) Complement
(b) Commutative
(c) Identity
(d) Distributive
(e) None of these

Question 47

Sketch the gated circuits associated with each of the following Boolean expressions.
Write the reduced expression for the following Karnaugh map.

Question 48

Sketch the gated circuits associated with each of the following Boolean expressions.
Give the Boolean expression associated with the following gated
circuit.

Question 49

Use real variable algebra to simplify the following expressions.

Question 50

Name the property demonstrated in each Boolean variable expression.

(a) Complement
(b) Commutative
(c) Identity
(d) Distributive
(e) None of these

Question 51

Sketch the gated circuits associated with each of the following Boolean expressions.

Question 52

Simplify each of the following Boolean expressions.

Question 53

Use the following truth table to complete the exercises.
Construct a Karnaugh map for this expression and find an
equivalent reduced expression.

Question 54

Use the following truth table to complete the exercises.

(a) Associative
(b) Commutative
(c) Identity
(d) Distributive
(e) None of these

Question 55

Use the following truth table to complete the exercises.

(a) Associative
(b) Commutative
(c) Identity
(d) Distributive
(e) None of these

Question 56

Use the following truth table to complete the exercises.
Write the boolean expression in dnf.

Question 57

Use the following truth table to complete the exercises.
Sketch the gated circuit that is equivalent to the reduced expression.

Question 58

Name the property demonstrated in each Boolean variable expression.

(a) Complement
(b) Commutative
(c) Identity
(d) Distributive
(e) None of these

Question 59

Simplify each of the following Boolean expressions.

Question 60

Use real variable algebra to simplify the following expressions.

Question 61

Write each of the Boolean functions as a Boolean expression in dnf.
Part III Chapter 5 Test C 137

Question 62

Write the reduced expressions for the following Karnaugh map.

Question 63

Give the Boolean expressions associated with each of the following gated circuits.

Question 64

Use Boolean algebra to simplify the following expressions, using x = 0.

Question 65

Give the Boolean expressions associated with each of the following gated circuits.

Question 66

Write the Boolean expression associated with each of the following switching circuits.

Question 67

Simplify each of the following Boolean expressions.

Question 68

Write each of the Boolean functions as a Boolean expression in dnf.

Question 69

Use Boolean algebra to simplify the following expressions, using x = 0.

Question 70

Use Boolean algebra to simplify the following expressions, using x = 0.

Question 71

Give the Boolean expressions associated with each of the following gated circuits.

Question 72

Write each of the Boolean functions as a Boolean expression in dnf.
Write the dnf expression corresponding to the shaded areas of the Venn diagram.

Question 73

Write the Boolean expression associated with each of the following switching circuits.

Question 74

Write the reduced expressions for the following Karnaugh map.