Chapter 02

Chapter Two
1. The inputs of this system A and B represent one binary number in the range 0:3.
The inputs C and D represent a second binary number (also in the range 0:3). There
are three outputs, X, Y and Z.
Show a truth table such that Y and Z represent a number equal to the the first
minus the second (if that is non-negative) and X is 1 if and only if the first is larger. If
the second is larger than the first, X is 0, and Y and Z don't matter.
2. Show the truth table for a system with four inputs, A3, A2, A1, and A0, and five
outputs, carry, Z3,,Z2, Z1, and Z0. The inputs represent a BCD digit between 0 and 9
(8421 code). All other inputs never happen. The output represents a the BCD code for
a decimal number equal to 3 plus 1.5 times the input (where fractions are rounded up).
The row for the input 7 has been completed.
A3 A2 A1 A0 Carry Z3 Z2 Z1 Z0
0 0 0 0
0 0 0 1
0 0 1 0
0 0 1 1
0 1 0 0
0 1 0 1
0 1 1 0
0 1 1 1 1 0 1 0 0
1 0 0 0
1 0 0 1
1 0 1 0
1 0 1 1
1 1 0 0
1 1 0 1
1 1 1 0
1 1 1 1
3. Use a truth table to demonstrate whether or not the following functions are equal.
(Be sure to state which, if any, are equal.)
f = a b' + b' c' + a c

g = (b' + c) (a + b + c')
h = b' c' + b c + a c
1
4. Using Properties 1 – 10, reduce each of the expressions below to a sum of
products expression. Show each step.
a. x' y' z' + x' y z' + x' y z + x y z (2 terms, 4 literals)

b. a' b' c' + a' b c' + a' b c + a b' c' + a b' c + a b c
(2 solutions, 3 terms, 6 literals)
c. g = x’ y’ z’ + x’ y z + x y’ z’ + x y z’ + x y z
(2 solutions, 3 terms, 6 literals)
5. Assume all variables are available both uncomplemented and complemented. (I

have shown both a sum of products and product of sums expression for f.)
f = w x’ + y’ z’ + x z’ = (x’ + z’) (w + x + y’)

a. Show a sum of product implementation using only AND and OR
gates of any size.
b. Show a product of sums implementation using AND and OR gates of any
size.
c. Show an implementation using only 2-input AND and OR gates.
2
6. For the following functions,
f (x, y, z) = ∑ m (0, 2, 4, 6, 7)
g (x, y, z) = ∑ m (0, 1, 2, 6)
Complete the truth table
x y z f g
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
b. Write a sum of minterms function in algebraic form (for example,

x' y z + ...)
c. Find a minimum sum of products expression (f: 2 terms, 4 literals;
g: 2, 3))
d. Find a PRODUCT OF SUMS expression in product of maxterms form.
e. Find a minimum PRODUCT OF SUMS form (2 terms, 4 literals).
7. Reduce each of the following expression to a minimum sum of products. Show

each step. You may NOT use the Karnaugh map.
a. g = a b’ + b c d’ + a’ b’ c’ d + a b’ c’ + b c’ d’
(3 terms. 7 literals)
b. f = a' b' d + a b + a b' d + b' c' d' + a b d’ (3 t, 6 l)
c. g = w x' + w' y + w y z' + x' y + w' x z + x y' z (4t, 9 l)
d. f = x’ z’ + x y z + w x’ + w y’ z (3t, 7l)
8. Expand the following to sum of minterms (sum of standard product terms).

Eliminate any duplicates.
f = x y z + x' y + x z + x' z
9. a. Manipulate the following to a sum of products expression.

f = (a' + b' + d) (a' + c' + d') (a + b + c')
b. Reduce it to a minimum sum of products (4 terms, 9 literals)
10. Assume all inputs are available both uncomplemented and complemented. For
each, show
f = w x’ + y’ z’ + x z’ = (x’ + z’) (w + x + y’)

g = w x + x z' + w z' + y z' = (w + z') (w + x + y) (x + y + z')
h = x z + w x + w' y z + w y' z' = (w + z) (w’ + x + y’) (x + y + z’)
3
a. a two-level implementation of using NAND gates of any size.
b. a two-level implementation of using NOR gates of any size.
c. An implementation using 2-input NAND gates (none of which may be used
as a NOT)
11. Implement each of the following function using only two-input NAND gates. NO
GATE MAY BE USED AS A NOT GATE. The functions are in minimum sum of product
form. Assume all inputs are available both uncomplemented and complemented.
a. f = w x' + w' y + y z' + x y' z (7 gates)

b. F = A B E + A B’ C’ + A’ D + C E’ + B’ D’ E’ (10 gates)
c. G = A B C E + A C' D E' + D' E + B D' + A' B' D (12 gates)
d. g = a’ c’ + a’ b d + a c d’ + a b’ c + b c e (8 gates)

Chapter 02

Uploaded by

Copyright:

Available Formats

Chapter 02

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Chapter 02

Uploaded by

Copyright:

Available Formats

Chapter Two

f = a b' + b' c' + a c

a. x' y' z' + x' y z' + x' y z + x y z (2 terms, 4 literals)

5. Assume all variables are available both uncomplemented and complemented. (I

f = w x’ + y’ z’ + x z’ = (x’ + z’) (w + x + y’)

b. Write a sum of minterms function in algebraic form (for example,

7. Reduce each of the following expression to a minimum sum of products. Show

8. Expand the following to sum of minterms (sum of standard product terms).

9. a. Manipulate the following to a sum of products expression.

f = w x’ + y’ z’ + x z’ = (x’ + z’) (w + x + y’)

a. f = w x' + w' y + y z' + x y' z (7 gates)

You might also like