Exercises 4 (18 Pts)

1. (3 pts)   Exercise 4.1 a, b, and c on page 106 of the text.

2. (4 pts)    a.    Give the truth table description of the network in Figure 4.19 on page 106 of the text.

                  b.    Give the tabular description of the network in Figure 4.19 on page 106 of the text.

3. (3 pts)    Show that the operation (gate) * described by the following table is universal. You can use the constant 1 (true).

x y | x*y
0 0 |  0
0 1 |  1
1 0 |  0
1 1 |  0
Hint:    Give definitions for NOT, AND, and OR in terms of * operation.
 
x y 1 |x*y|x'=x*1|x AND y=               |x OR y=
0 0 1 | 0 |      |                       |
0 1 1 | 1 |      |                       |
1 0 1 | 0 |      |                       |
1 1 1 | 0 |      |                       |
4. (2 pts)    Question 4.10 from the text, page 108.

Hint: Define variables (e.g. T1, T2, etc.) for each gate output. For example, the leftmost NAND gate output could be defined to be T3. The outputs of the next pair of NAND gates could be labeled T1 and T2. Then z1 = (T1*T2)' = ((x1*T3)'*(T3*x0)')' =

5. (2 pts)    Question 4.14a from the text, page 110. Give switching expression for z only. The triangle with a circle (on either end) is a NOT logic operation. For example, one product term would be: I0s2's1's0'E

6. (4 pts)

  1. Give the equivalent AND-OR-NOT expression for the network of Figure 4.22. Remember that a circle implies NOT.
  2. Describe the resulting network using VHDL.