Computer Science – Boolean logic | e-Consult
Boolean logic (1 questions)
Login to see all questions.
Click on a question to view the answer
Logic Expression: Z = (X AND Y) XOR (X AND Y)
Alternatively, Z = (X AND Y) NOT (X AND Y)
Which simplifies to Z = NOT (X AND Y)
Or, using DeMorgan's Law: Z = NOT X OR NOT Y