We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
I think we can further simplify the above boolean function (^ is for XOR):
(((A B) ^ (A + B)) (A ^ B)) =
apply A ^ B = (A'B) + (A B')
( ((A B)' (A + B)) + ((A B) (A + B)')) (A ^ B)) =
apply DeMorgan law (X+Y+...)'=X'Y'Z'... and (XYZ...)'=X'+Y'+...
( ((A' + B') (A + B)) + ((A B) (A' B'))) (A ^ B)) =
apply Distributive Law X(Y+Z) = XY + XZ
(A'A + A'B + AB' + BB' + AA' + BB') (A ^ B) =
apply X+X=X, XX=X
(A'B + AB') (A ^ B) =
(A ^ B) (A ^ B) = A ^ B = A xor B
So we get the same result by just using a simple A XOR B. Is the above simplifacation correct? Can anyone confirm that?
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
AND xor OR
You are viewing a single comment's thread. Return to all comments →
I think we can further simplify the above boolean function (^ is for XOR):
So we get the same result by just using a simple A XOR B. Is the above simplifacation correct? Can anyone confirm that?