GCSE J277 · Boolean logic / A level H446 · Boolean algebra
Predict → Run → Investigate → Modify → Make
Toggle the input switches and predict the output. Click a wire or a connected input pin to select its connection. The wire Inspector lets you change From immediately, choose To and Move wire, or Delete wire. Delete/Backspace also removes a focused wire; Undo restores edits. Click a source’s small output port, then a gate’s input port or an output lamp’s input port to connect them. The inspector also provides connection menus. Drag gate bodies to position them, or focus a gate and use arrow keys (Shift for larger steps). Small circles are wiring ports. Auto arrange organises gates by signal flow; Undo restores your previous layout. Add gates, inspect the complete truth table, and modify the circuit to meet a challenge.
Live versus Step
Live shows the settled Boolean result immediately. Trace first shows inputs alone; Step then evaluates gates in dependency order and finally the lamps. A ? means unconnected or not yet evaluated, not 0. Input changes restart an active trace. This idealised combinational model does not simulate physical propagation delays, voltage, hazards or analogue effects.
Basic and Advanced
Basic offers AND, OR and NOT for GCSE. Use + Switch and + Bulb above the canvas to add up to four of each. Change the Inputs count to remove switches, or inspect a bulb to delete it. Advanced adds XOR, NAND, NOR, half/full-adder examples, Boolean equivalence, a four-variable Karnaugh map and a positive-edge-triggered D-type model. Switching views does not erase your circuit. Feedback loops in the combinational builder are rejected; the D-type workspace models stored state separately.
Working without page scrolling
The desktop layout keeps the canvas, inspector and input/output strip visible together. Focus Mode hides navigation. Large circuits can be zoomed and panned inside the canvas; Fit returns to the full view. Optional explanations and long inspector content scroll inside their panels. Small screens use a stacked layout.
Challenge checking and saving
Every challenge checks all input combinations and its stated gate constraints. If a row fails, those inputs are applied so you can investigate the counterexample. Activities are independent and can be replayed. Completion, hints and checks stay on this device; shared computers share them. No XP or class scores are recorded. Explore auto-saves one local draft including gate positions. Downloaded circuit files include the layout too. Importing a file, loading an example or starting a blank circuit can be reversed with Undo.
Worked challenge solutions
01 · Both switches
Prediction: 0. AND needs both inputs to be 1.
Toggle A and B to 1. The output lamp should light.
Q = A AND B02 · Either switch
Prediction: 1. OR is inclusive: either or both inputs can make it 1.
Add an OR gate. Connect A and B to its inputs, then its output to Q.
Q = A OR B03 · The opposite
Prediction: 1. NOT reverses its single input.
Select g1 and connect its input to A.
Q = NOT A04 · Arm the alarm
Prediction: 0. The alarm is not armed, so C prevents the output becoming 1.
The OR gate combines the sensors. Connect C to the remaining AND input.
Q = (A OR B) AND C05 · A crossed wire
Prediction: 1. It currently calculates A AND A. Changing B has no effect.
Select g1. Change its second input from A to B.
Q = A AND B06 · Neither sensor
Prediction: 1. Neither sensor is on. Inverting the OR result produces 1.
Connect A/B to OR, feed that into NOT, and connect NOT to Q.
Q = NOT(A OR B)07 · Exactly one
Prediction: 0. XOR is 1 when its two inputs differ.
Select g1 and change its gate type from OR to XOR.
Q = A XOR B08 · One gate, opposite signal
Prediction: 0. A AND A equals A. NAND inverts that result.
Connect A to both inputs of one NAND gate, then connect it to Q.
Q = NOT A09 · A different route
Prediction: 1. De Morgan's law gives NOT A AND NOT B.
Invert A and B separately, then AND those two results.
Q = NOT(A OR B)10 · Repair the carry
Prediction: 0. 1+0 gives binary 01: sum 1, carry 0.
The carry is only 1 for A=B=1. Change g2 to AND.
Q = A XOR B; R = A AND B11 · Carry it forward
Prediction: 1. 1+1+1=3, which is binary 11: sum 1, carry 1.
g4 combines C with the intermediate sum. Connect its second input to g1.
Q = (A XOR B) XOR C; R = (A AND B) OR (C AND (A XOR B))12 · Less is more
Prediction: 0. The absorption law reduces the expression to A.
Wire input A directly to Q. Delete g1 and g2.
Q = AAdvanced workshops
Boolean expressions are checked over all 16 assignments of A–D using a small Boolean parser, not JavaScript. In Karnaugh maps, rows AB and columns CD use Gray order 00, 01, 11, 10; groups may wrap and overlap, but must form all-one rectangles with power-of-two dimensions. The minimum cover minimises the number of terms, then the total literals. There are no don’t-care cells in this version.
The D-type workshop captures D on a rising clock edge and holds Q on falling edges or D changes. Reset sets Q to 0 for a known teaching state; this does not imply that real hardware always powers up with Q=0. Workshop scratch work is not included in circuit-file saves.
OCR GCSE J277 specification · OCR A-level H446 specification
Back to Primm Tools