Français · article non traduitGitHub

The devutils collection

From Boolean decisions to switching circuits

Learn the operations, examine their historical use, then verify a model in the gate workbench.

On this page

What you will learn

This short path connects symbolic operations with a logical model of switches. You will read a truth table, explain the series/parallel interpretation, and test all input combinations for four gates. Allow about 30–45 minutes; the estimate is a suggested study pace, not a measured completion time.

No programming environment or electronics kit is required. You need a browser and the ability to read a small table.

How to follow the path

Use the ordered reading steps below. After the first article, write down the four rows of AND and OR without looking. After the historical entry, explain why analysis and synthesis are different tasks. In the lab, predict each result before changing the inputs.

Completion check

You have finished when you can reproduce the tables, explain why OR and XOR differ when both inputs are 1, and state one physical property the model leaves out. Revisit the first article if any prediction disagrees with a table.

This is a complete introductory path. It does not claim to teach the construction of a CPU or the electrical design of a transistor circuit; those require further material.

Reading steps

  1. Boolean algebra
  2. Logic meets switching circuits
  3. Boolean gate workbench

Verification record

  • Sources assessed by Codex (assistant)
  • Example checks recorded
  • Independent human review pending

Selected claims have been assessed against the passages below. This record does not certify every sentence or guarantee correctness.

Inspect claims, evidence and limitations

Source assessment: . 1 of 1 selected claims marked supported by the assessor. This is not a coverage percentage for the article.

  1. The short path uses Boolean rules and the historical switching-network connection.

    Assessor finding: supported · interpretation · Article passage

    The path order and 30–45 minute study suggestion are original editorial choices, not measured outcomes.

Reproducible checks

  • Published step references and OR/XOR completion condition.

    Passed on 2026-10-27

    node --test --test-name-pattern='the introductory path references published content and its gate exercise is correct' src/library/exercises.test.ts

Limits and open work

  • Study duration is an estimate.
  • A path’s editorial order is not validated by the historical source.

Independent human review

Pending. No independent human reviewer has signed off this version.

Content fingerprint: e919e8bf1c10458089f3abcc8fde20d054971b45a986bb7b398ba64e3854bb40. An article change invalidates this assessment.

Sources

  1. Shannon, A Symbolic Analysis of Relay and Switching Circuits (1938)
  2. Cornell CS 3410, Gates and Logic — definitions and arithmetic

Published by devutils · Updated · Original explanatory text; sources retain their own terms.