76 Chapter 2 The Logic of Compound Statements

Exercise Set 2.4

Give the output signals for the circuits in 1–4 if the input signals 18.
P Q R S
are as indicated.
1 1 1 0
1. P
OR R 1 1 0 1
1 0 1 0
Q NOT
1 0 0 0
0 1 1 1
input signals: P = 1 and Q=1
0 1 0 0
2. P
0 0 1 0
OR
Q AND R 0 0 0 0

NOT
19.
P Q R S

input signals: P = 1 and Q=0 1 1 1 0

1 1 0 1
3. P
1 0 1 0
AND
Q NOT OR S 1 0 0 1
0 1 1 0
R
0 1 0 1
input signals: P = 1, Q = 0, R=0
0 0 1 0
4. P 0 0 0 0
OR
Q OR S
20.
P Q R S
AND NOT
R 1 1 1 1
input signals: P = 0, Q = 0, R=0 1 1 0 0
1 0 1 1
In 5–8, write an input/output table for the circuit in the refer-
enced exercise. 1 0 0 0
0 1 1 0
5. Exercise 1 6. Exercise 2
0 1 0 0
7. Exercise 3 8. Exercise 4
0 0 1 0
In 9–12, find the Boolean expression that corresponds to the cir- 0 0 0 1
cuit in the referenced exercise.
9. Exercise 1 10. Exercise 2 21.
P Q R S
11. Exercise 3 12. Exercise 4 1 1 1 0

Construct circuits for the Boolean expressions in 13–17. 1 1 0 1

1 0 1 0
13. ∼P ∨ Q 14. ∼(P ∨ Q)
1 0 0 0
15. P ∨ (∼P ∧ ∼Q) 16. (P ∧ Q) ∨ ∼R
0 1 1 1
17. (P ∧ ∼Q) ∨ (∼P ∧ R)
0 1 0 1
For each of the tables in 18–21, construct (a) a Boolean expres- 0 0 1 0
sion having the given table as its truth table and (b) a circuit
having the given table as its input/output table. 0 0 0 0

Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
 2.4 Application: Digital Logic Circuits 77

22. Design a circuit to take input signals P, Q, and R and out- b. P

put a 1 if, and only if, P and Q have the same value and Q OR
Q NOT
and R have opposite values.
23. Design a circuit to take input signals P, Q, and R and out-
put a 1 if, and only if, all three of P, Q, and R have the
same value. 29. a. P
AND
24. The lights in a classroom are controlled by two switches: Q
one at the back and one at the front of the room. Moving
either switch to the opposite position turns the lights off if NOT
AND OR
they are on and on if they are off. Assume the lights have
been installed so that when both switches are in the down
position, the lights are off. Design a circuit to control the
switches. AND
NOT
25. An alarm system has three different control panels in three
different locations. To enable the system, switches in at
least two of the panels must be in the on position. If fewer b. P
OR
than two are in the on position, the system is disabled. Q
Design a circuit to control the switches.
Use the properties listed in Theorem 2.1.1 to show that each For the circuits corresponding to the Boolean expressions in
pair of circuits in 26–29 have the same input/output table. (Find each of 30 and 31 there is an equivalent circuit with at most
the Boolean expressions for the circuits and show that they are two logic gates. Find such a circuit.
logically equivalent when regarded as statement forms.)
30. (P ∧ Q) ∨ (∼P ∧ Q) ∨ (∼P ∧ ∼Q)
26. a. P 31. (∼P ∧ ∼Q) ∨ (∼P ∧ Q) ∨ (P ∧ ∼Q)
AND
Q OR 32. The Boolean expression for the circuit in Example 2.4.5 is

b. P (P ∧ Q ∧ R) ∨ (P ∧ ∼Q ∧ R) ∨ (P ∧ ∼Q ∧ ∼R)
OR
AND (a disjunctive normal form). Find a circuit with at most
Q
three logic gates that is equivalent to this circuit.
33. a. Show that for the Sheffer stroke |,
27. a. P NOT P ∧ Q ≡ (P | Q) | (P | Q).
AND
b. Use the results of Example 2.4.7 and part (a) above to
AND NOT
Q write P ∧ (∼Q ∨ R) using only Sheffer strokes.
34. Show that the following logical equivalences hold for the
b. P
OR NOT Peirce arrow ↓, where P ↓ Q ≡ ∼(P ∨ Q).
Q a. ∼P ≡ P ↓ P
b. P ∨ Q ≡ (P ↓ Q) ↓ (P ↓ Q)
c. P ∧ Q ≡ (P ↓ P) ↓ (Q ↓ Q)
28. a. P H d. Write P → Q using Peirce arrows only.
AND
Q e. Write P ↔ Q using Peirce arrows only.

AND
NOT
OR

NOT
AND

NOT

Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.