Computer Science
State the dual form of the following boolean expression:
X.Y'(X.Y'.Z + X + X'.Z')
Boolean Algebra
2 Likes
Answer
Dual of X.Y'(X.Y'.Z + X + X'.Z') is:
X+Y'+((X+Y'+Z).X.(X'+Z'))
Answered By
1 Like
Related Questions
Reduce the following to its simplest form using laws of boolean algebra. At each step clearly state the law used for simplification.
A.B' + A'.B.C' + (A.C') + B.CGiven the boolean function F(x, y, z)=Σ(0, 2, 4, 5, 6). Reduce it using Karnaugh's map.
State the two Idempotent laws of boolean algebra. Verify any one of them using the truth table.
What is the application of boolean algebra in computer science?