Boolean Algebra Quiz

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

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

Previous Previous Index Map
To submit your questions and queries please click here: Queries
Composed by David Belton - April 98