Computer Science
Given the boolean function F(x, y, z)=Σ(0, 2, 4, 5, 6). Reduce it using Karnaugh's map.
Boolean Algebra
16 Likes
Answer
From Quad (0,2,4,6):
Rows representing the Quad: x' + x = 1
Columns representing the Quad: y'z' + yz' = z'
Term Obtained = z'
From Pair (4,5):
Rows representing the Pair: x
Columns representing the Pair: y'z' + y'z = y'
Term Obtained = xy'
Result = xy' + z'
Answered By
14 Likes
Related Questions
What is the application of boolean algebra in computer science?
Given: F(x, y, z)=Σ(1, 4, 5, 6, 7).
Prove that: F(x, y, z)=π(0, 2, 3).State the dual form of the following boolean expression:
X.Y'(X.Y'.Z + X + X'.Z')State the two Idempotent laws of boolean algebra. Verify any one of them using the truth table.