Boolean Algebra Exercise Generator and Boolean Expression Solver

What is the Boolean algebra exercise generator?

Nalgoritmo's Boolean algebra generator creates logic circuit exercises and also solves Boolean expressions. Click “New circuit” to get a random exercise, or type your own Boolean expression and click “Solve” to see its logic circuit, Boolean formula, timing diagram and values per interval.

It is made for students, teachers and anyone studying digital electronics, logic gates, computer architecture or programming logic who wants to practice reading logic circuits and writing Boolean expressions.

Features

• Exercise generator: “New circuit” builds a random logic circuit, and an exercise counter shows which exercise you are on.
• Boolean expression solver: type an expression such as S = (A · B) + ~C and click “Solve” to get its circuit and output.
• Customizable exercises: choose the complexity (1 to 10 gates), the allowed gates (all, AND / OR / NOT, or no NOT), gate connections with or without fan-out, the input type (Boolean 0/1, conditional with relational operators, or Boolean LED timer), the timer and the interval speed.
• Show answer: the logic circuit appears as a logic diagram, the Boolean expression appears as a Boolean formula, the timing diagram shows output S together with the formula, and the values-per-interval table shows the inputs with the output. Below it, the expression and the output are listed one per line.
• Traditional symbols: AND, OR, NOT, NAND, NOR, XOR and XNOR gates drawn with IEC/ANSI symbols.

How to use it

1. Set the options: complexity, allowed gates, gate connections, input type, timer and interval speed.
2. Click “New circuit” to generate an exercise, or type a Boolean expression in “Solve an expression” and click “Solve”.
3. Work out the circuit, the expression and the output on your own.
4. Click “Show answer” to check the logic diagram, the Boolean formula, the timing diagram and the values per interval.

Frequently asked questions

How do I solve a Boolean expression online?

Type the expression in the “Solve an expression” box, for example S = (A · B) + ~C, and click “Solve”. The page draws the logic circuit and shows the Boolean formula, the timing diagram and the values per interval together with the output.

Which operators can I type?

NOT with ~ or !, AND with · . * or &, XOR with ⊕ or ^, and OR with + or |. You can also use the words NAND, NOR and XNOR. Variables are the letters A to Z, and S is the output. Precedence is NOT, AND, XOR, OR.

What does “Show answer” display?

The logic circuit as a logic diagram, the Boolean expression as a formula, the timing diagram with output S next to the formula, and the values-per-interval table with the output. The expression and the output are also listed one per line below the table.

Which input types are available?

Boolean inputs (0 / 1), conditional inputs that use relational operators, and Boolean timer inputs, where each input is an LED that turns on and off.

How many gates can an exercise have?

From 1 to 10 gates. You can allow all gates, only AND / OR / NOT, or every gate except NOT, and choose whether gate outputs may branch (fan-out).