1.Prove through the use of truth tables that (xy)z = x(yz) = xyz.

You have the ability to create the 3 required truth tables by using the table tool (left most tool in the bottom row above).

2.Using a truth table prove the following deMorgan's theorem for three variables.

(x + y + z)' = x'y'z'

3.Simplify the following Boolean Expression to a minimum number of literals.

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

4.Simplify the following Boolean Expression to a minimum number of literals.

a'bc + abc' + abc + a'bc'

5.When writing the terms put them in alphabetical order with a space between the terms and operators.

(example: xy' + xyz, not y'z+zxy) You won't get the problem wrong, but it will ensure you get good feedback.

Simplify the following Boolean Expression to a minimum number of literals.

(a'b' + c)(a + b + c')

6.When writing the terms put them in alphabetical order with a space between the terms and operators.

(example: xy' + xyz, not y'z+zxy) You won't get the problem wrong, but it will ensure you get good feedback.

Reduce to two literals.

wxy'z + w'xz + wxyz

7.For this question, you will need to draw your solution using some form of logic drawing software (i.e. Cadence / OrCad or Logisim). You will need to upload a pdf of your drawing. You DO NOT need to simulate these designs.

Draw the design for this Boolean Expression : wxy'z + w'xz + wxyz

Draw the design for the simplified expression.

NOTE: Both designs can be on the same page.