7. Given the function F(X,Y,Z) = XZ + Z(X'+ XY), the equivalent, most simplified Boolean representation for F is

  1. Z + YZ
  2. Z + XYZ
  3. XZ
  4. X + YZ
  5. none of the above

4 is WRONG. ZX + ZX' does not reduce to X; look at the logic adjacency theorem.

[ Go Back To Question 7 ]

[ Go Back To The Beginning Of Quiz ]