Prashnikaप्रश्निका
Code
About

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.

How to use it

  1. 1Type a Boolean expression such as A'B + AB', or give minterms like F(A,B,C) = Σ(1,3,5).
  2. 2Press Solve, or tap an example to see how it is written.
  3. 3Read the working: the laws used, the truth table, the K-map groups, the minimal SOP and POS, and the circuits.
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, and so do the words AND, OR, NOT, XOR, NAND, NOR and XNOR. Up to 6 variables. Or give minterms: F(A,B,C) = Σ(1,3,5) + d(7), or maxterms with π.

Worked example

A'B'C + A'BC + AB'C + ABC' + ABC

This is the kind of answer you get. Put these values in the boxes or type your own.

Answer

Minimal SOP
F = AB + C
Minimal POS
F = (A + C)(B + C)
Minterms
F(A, B, C) = Σ(1, 3, 5, 6, 7)
Maxterms
F(A, B, C) = π(0, 2, 4)

Read as A'B'C + A'BC + AB'C + ABC' + ABC. It is a contingency (sometimes 1, sometimes 0).

Steps, law by law

F = A'B'C + A'BC + AB'C + ABC' + ABC

  1. = A'C(B' + B) + AB'C + ABC' + ABCDistributive law AB + AB' = A(B + B')
  2. = A'.C.1 + AB'C + ABC' + ABCComplement law A + A' = 1
  3. = A'C + AB'C + ABC' + ABCIdentity law A.1 = A
  4. = A'C + AC(B' + B) + ABC'Distributive law AB + AB' = A(B + B')
  5. = A'C + A.C.1 + ABC'Complement law A + A' = 1
  6. = A'C + AC + ABC'Identity law A.1 = A
  7. = C(A' + A) + ABC'Distributive law AB + AB' = A(B + B')
  8. = C.1 + ABC'Complement law A + A' = 1
  9. = C + ABC'Identity law A.1 = A
  10. = C + ABAbsorption law A + A'B = A + B
Convert to POS, step by step

Work out F' as a sum of products, then F = (F')' by De Morgan's law.

  1. F' = (C + AB)'Complement F' = (F)'
  2. F' = C'(AB)'De Morgan's law (A + B)' = A'B'
  3. F' = C'(A' + B')De Morgan's law (AB)' = A' + B'
  4. F' = C'A' + C'B'Distributive law A(B + C) = AB + AC
  5. F = (C'A' + C'B')'Complement again F = (F')'
  6. F = (C'A')'(C'B')'De Morgan's law (A + B)' = A'B'
  7. F = ((C')' + (A')')(C'B')'De Morgan's law (AB)' = A' + B'
  8. F = (C + (A')')(C'B')'Involution law (A')' = A
  9. F = (C + A)(C'B')'Involution law (A')' = A
  10. F = (C + A)((C')' + (B')')De Morgan's law (AB)' = A' + B'
  11. F = (C + A)(C + (B')')Involution law (A')' = A
  12. F = (C + A)(C + B)Involution law (A')' = A

Truth table

ABCAB'CA'B'C + A'BC + AB'CABC'ABC'A'B'C + A'BC + AB'C + ABC'ABCA'B'C + A'BC + AB'C + ABC' + ABC
00000010000
00101000101
01000010000
01101000101
10000010000
10111000101
11000111101
11100100011

K-map

Grouping the 1s (SOP)
BCA00011110010113124517161
  • AB pair: cells 6, 7
  • C quad: cells 1, 3, 5, 7
Grouping the 0s (POS)
BCA000111100100132040576
  • (A + C) pair: cells 0, 2
  • (B + C) pair: cells 0, 4

Canonical forms

SOP (sum of minterms)

F = A'B'C + A'BC + AB'C + ABC' + ABC

POS (product of maxterms)

F = (A + B + C)(A + B' + C)(A' + B + C)

Logic circuit

Your expression as written Gate for gate as typed; A' is taken as an input line.
Logic circuit: Your expression as written
Minimal SOP AND, OR and NOT gates.
Logic circuit: Minimal SOP
Minimal POS OR, AND and NOT gates.
Logic circuit: Minimal POS
NAND gates only From the minimal SOP; a NOT is a NAND with its inputs joined.
Logic circuit: NAND gates only
NOR gates only From the minimal POS; a NOT is a NOR with its inputs joined.
Logic circuit: NOR gates only

About the Boolean algebra solver

What it does

Boolean algebra questions in ISC Computer Science ask you to simplify an expression, prove that two expressions are equal, draw a truth table, group a K-map or draw the logic circuit. This solver does all of them from one input and names the law used at every step, so you can compare it with your own working.

How the answer is worked

  1. The expression is read and its truth table is built (up to 6 variables).
  2. It is simplified one step at a time with the Boolean laws: commutative, distributive, absorption, De Morgan’s and the rest, each named.
  3. The K-map is filled in and the biggest groups of 1s (pairs, quads, octets) give the minimal SOP; groups of 0s give the minimal POS.
  4. The circuit is drawn with AND, OR and NOT gates, then with NAND gates only and NOR gates only.

How to write the input

NOT is A' (or ~A), AND is AB or A.B, OR is +, XOR is ⊕ (the words AND, OR, NOT, XOR, NAND and NOR work too). For a function given by its minterms write F(A,B,C) = Σ(1,3,5) + d(7), or use π for maxterms. The buttons under the box type the symbols for you.

Common questions

What is the difference between SOP and POS?

SOP (sum of products) is an OR of AND terms, read from the 1s of the truth table or K-map. POS (product of sums) is an AND of OR terms, read from the 0s. Both describe the same function.

How do I check that two expressions are equal?

Type one in the first box, open “Check that it equals another expression” and type the second. The solver compares them and tells you whether they are equal.

Why do NAND and NOR gates matter?

Each is a universal gate: any circuit can be built from NAND gates alone, or from NOR gates alone. Questions often ask for exactly that, so the solver draws both versions.

What does d(…) mean in F(A,B,C,D) = Σ(…) + d(…)?

The numbers in d(…) are don’t-care conditions: cells you may treat as 1 or as 0, whichever makes the K-map groups bigger.

Practise on real ISC questions

More Computer Science tools

All study tools →