PRASHNIKAप्रश्निका

Boolean algebra solver

Simplify a Boolean expression the way ISC Computer Science asks for it: the working law by law, the truth table, the K-map with its groups, the minimal SOP and POS forms, and the logic circuit - also with NAND or NOR gates only. Free, with nothing to sign up for.

Check that it equals another expression

Write NOT as A' (or ~A), AND as AB or A.B, OR as A + B; ⊕, => and <=> work too. Up to 6 variables. Or give minterms: F(A,B,C) = Σ(1,3,5) + d(7), or maxterms with π.

Try: A'B'C + A'BC + AB'C + ABC' + ABCF(A,B,C,D) = Σ(0,2,5,7,8,10,13,15)F(P,Q,R,S) = π(0,1,3,5,7,8,9,11) + d(2,13)(X + Z)(XY + YZ) + XZ + Y(A + B')(A' + B)A ⊕ B ⊕ C

Practise on real ISC questions