Homeworks #1 and #2

Homework 1 -- Due February 6

Problem 1

Simplify the following expressions using Boolean algebra

• x+ x' z + y z
• (x + x)(y + x)x'

Problem 2

List a truth table for the following function:

• F(A, B, C) = A + B'(A + C)

Now simply the function using Boolean algebra or Karnaugh maps.

Problem 3

Simplify the following functions using Karnaugh maps.

• F(A, B, C, D) = (0, 1, 3, 7, 12, 14)
• F(x, y, z) = (1, 4, 5, 6, 7)

Homework 2 -- Due February 20

Do problem 1-16 (page 38) of the textbook and use diglog to ``implement'' your design. Save your completed circuit in your home directory in a file called home2.lgf.

Back to the Handout index