Boolean Algebra Exercise Generator and Boolean Expression Solver

Logic circuit, Boolean expression, timing diagram and values per interval

⚙️ Settings

⌨️ Solve an expression

Type a Boolean expression: the circuit, the expression, the timing diagram and the values per interval will follow what you wrote. For a random exercise, use “New circuit”.

Gates
-
Inputs
-
Validation
-

🔌 Logic circuit

Traditional IEC/ANSI symbols. White background for easier reading.

🧮 Boolean expression

Expression hidden

📊 Timing diagram

S

📋 Values per interval and Truth table

Answer hidden.

What is the Boolean algebra exercise generator?

The Nalgoritmo 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 the logic circuit, the Boolean formula, the timing diagram and the values per interval.

It was 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” creates 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 the circuit and the output.
  • Configurable exercises: choose the complexity (from 1 to 10 gates), the allowed gates (all, AND / OR / NOT, or no NOT), the connections between gates with or without branching (fan-out), the input type (Boolean 0/1, conditionals with relational operators, or a Boolean timer with an LED), 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 next to the formula, and the table of values per interval shows the inputs with the output. Below it, the expression and the output appear one per line.
  • Simplified expression: below the Boolean expression, the page shows its simplified form, computed from the circuit's full truth table (sum of products, product of sums or XOR, whichever has the fewest literals).
  • Traditional symbols: AND, OR, NOT, NAND, NOR, XOR and XNOR gates drawn with IEC/ANSI symbols.

How to use

  1. Set the options: complexity, allowed gates, connections between gates, input type, timer and interval speed.
  2. Click “New circuit” to generate an exercise, or type a Boolean expression under “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” field, 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 the “Show answer” button 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 table of values per interval with the output. The expression and the output also appear one per line below the table. The simplified Boolean expression also appears below the Boolean expression.

What types of inputs are there?

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 all except NOT, and choose whether gate outputs can branch (fan-out).