4. Given the function F(A,B,X,Y) = AB + X'Y, the most simplified Boolean representation for F' is

  1. (AB)' + (X'Y)
  2. A'*B' + XY'
  3. (A'+ B')(X + Y')
  4. (AB + X'*Y)'
  5. (AB)'(X'*Y)'

3 is CORRECT. DeMorgan's Theorem is applied 2 times:

F' = (AB + X'Y)' 
   = (AB)'(X'Y)'       First time: (x + y)' = x'*y'
                       (Let x = AB and y = X'Y)
   = (A'+ B')(X + Y')  Second time.  Use: (x*y)' = x' + y'

[ Go Back To Question 4 ]

[ Go Back To The Beginning Of Quiz ]