You are on page 1of 9

HOMEWORK # 3

PROBLEM 1. [10 POINTS] Construct truth tables for the following Boolean expressions, where the complement of a variable w is written as w. a) xyz + xyz + xyz
xyz + xyz + xyz Inputs Outputs x y z xyz 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 Inputs Outputs x y' z' xyz' 0 1 1 0 0 1 0 0 0 0 1 0 0 0 0 0 1 1 1 1 1 1 0 0 1 0 1 0 1 0 0 0 Inputs Outputs x' y z' xyz 1 0 1 0 1 0 0 0 1 1 1 1 1 1 0 0 0 0 1 0 0 0 0 0 0 1 1 0 0 1 0 0

=
xyz 0 0 0 0 0 0 0 1 Inputs Outputs xyz' xyz xyz + xyz + xyz 0 0 0 0 0 0 0 1 1 0 0 0 1 0 1 0 0 0 0 0 0 0 0 1

b) xz + xyz
xz + xyz x 0 0 0 0 1 1 1 1 y 0 0 1 1 0 0 1 1 z 0 1 0 1 0 1 0 1 x'z 0 1 0 1 0 0 0 0 xyz 1 0 0 0 0 0 0 0 xz + xyz 1 1 0 1 0 0 0 0

PROBLEM 2 [10 POINTS] The truth table for Boolean function F is shown below. Write F in sum-of-products form.

The F function in SOP form is as follows: F(x, y, z) = x'yz' + x'yz + xy'z


x 0 0 0 0 1 1 1 1 y 0 0 1 1 0 0 1 1 z 0 1 0 1 0 1 0 1 F 0 0 1 1 0 1 0 0 Minterm

x'y'z' x'y'z x'yz' x'yz xy'z' xy'z xyz' xyz

x 0 0 0 0 1 1 1 1

y 0 0 1 1 0 0 1 1

z 0 1 0 1 0 1 0 1

x' y' z' 1 1 1 1 0 0 0 0 1 1 0 0 1 1 0 0 1 0 1 0 1 0 1 0

x' y z' x'yz 1 0 1 1 0 0 1 1 1 1 1 0 0 0 1 0 0 0 0 1 1 0 1 0 0 0 1 0 0 0 0 0

x' y z x'yz 1 0 0 1 0 1 1 1 0 1 1 1 0 0 0 0 0 1 0 1 0 0 1 1 0 0 0 1 0 0 0 0

x y' z xy'z 0 1 0 0 1 1 0 0 0 0 0 1 1 1 0 1 1 1 1 0 0 1 0 1 0 0 0 0 0 1 0 0

F(x, y, z) = x'yz' + x'yz + xy'z 0 0 1 1 0 1 0 0

PROBLEM 3 [10 POINTS] a) Null and Lobur, Chapter 3, exercise 29. Draw the combinational circuit that directly implements the following Boolean expression:
F (x, y, z) = xz + (xy + z)

b) Null and Lobur, Chapter 3, exercise 32. Find the truth table that describes the following circuit:

F (x, y, z) = (x + xy)

(xz)

x
0 0 0 0 1 1 1 1

y
0 0 1 1 0 0 1 1

z x' y' z'


0 1 0 1 0 1 0 1 1 1 1 1 0 0 0 0 1 1 0 0 1 1 0 0 1 0 1 0 1 0 1 0

x'y
0 0 1 1 0 0 0 0

x + xy
0 0 1 1 1 1 1 1

xz
0 1 0 1 0 0 0 0

(x + xy) X OR (xz)
0 1 1 0 1 1 1 1

PROBLEM 4 [10 POINTS] Consider a data communications system that represents characters using ASCII with odd parity. Each 7-bit ASCII character is followed by a parity bit. Specify the resulting 8-bit code word for each of the characters in the following message that is to be transmitted: Hokies! (There are 7 characters in this message, including the exclamation mark.) 8- bit code word for each of the characters of Hokies! message using ASCII code with odd parity.

H o k i e s !

## ## ## ## ## ## ##

1 1 0 1 1 0 1

1 1 1 1 1 1 0

0 1 1 1 1 1 1

0 0 1 0 0 1 0

1 1 0 1 0 0 0

0 1 1 0 1 0 0

0 1 0 0 0 1 0

0 1 1 1 1 1 1

The parity bit is showed at the left for each character, the others 7 bits are from the ASCII table.

PROBLEM 5 [10 POINTS] Consider table 3.10 in Null and Lobur. Assume that the parity bit is a function of Boolean variables x, y, and z. Represent this function in the following ways: a) as a Boolean algebra expression; and
x
0 0 0 0 1 1 1 1

y
0 0 1 1 0 0 1 1

z
0 1 0 1 0 1 0 1

Parity Bit
1 0 0 1 0 1 1 0

xyz

xyz xyz xyz

Parity bit (x, y, z) = xyz + xyz + xyz + xyz b) as a combinational logic diagram (logic circuit).

PROBLEM 6 [10 POINTS] Null and Lobur, Chapter 3, exercise 51. Complete the truth table for the following sequential circuit.

TRUTH TABLE
x 0 0 0 0 1 1 1 1 y 0 0 1 1 0 0 1 1 z 0 1 0 1 0 1 0 1 S 0 1 1 0 1 0 0 1 Q 0 0 0 1 0 1 1 1

PROBLEM 7 [20 POINTS] Consider the following sequential logic circuit.

Assume that the flip-flops are positive-edge triggered, and assume that they have all been reset to 0. Complete the following timing diagram for signals A, Q2, Q1, and Q0. (Initially, A has value 1 and Q2=Q1=Q0=0.)

SOLUTION

PROBLEM 8 [20 POINTS] In this problem, you are to design, simulate and test a simple combinational logic circuit using Logisim, a graphical tool for designing and simulating logic circuits. The tool can be downloaded as freeware from http://ozark.hendrix.edu/~burch/logisim/. The circuit that you should design is a 2-bit comparator. It takes two 2-bit values, A1A0 and B1B0, as inputs and has one output, X. The output should be equal to 1 if and only if the two 2-bit values are identical (e.g., if A1A0 = 01 and B1B0 = 01). Simulate your circuit using Logisim, testing for all combinations of inputs. Label all inputs and the output. Insert into your homework submission a picture of the circuit as drawn in Logisim. You can use the Export to GIF option to do that. (Please do not provide the picture as a separate file.)
(Recommended: Complete the tutorial provided with Logisim 2.7.1. The tutorial is under the Help menu in Logisim or at http://ozark.hendrix.edu/~burch/logisim/docs/2.7/en/html/guide/tutorial/. This is for your own education. This will not gain you extra credit.)