අන්තර්ගතයට යන්න
mcqdinethlive
SPARK · UNIT 4

Learn Boolean laws from their history

The Boolean laws of A/L ICT Unit 4 began as rules of clear thinking, became rules for switches, and now decide how many gates a chip needs. Each law is easier to keep through the problem it solved.

සිංහලෙන් කියවන්න

The Boolean laws in Unit 4 are easier to keep through their history than as a list of names. The complement law A.A' = 0 is Aristotle's principle of contradiction, about 2,300 years old: a light cannot be on and off at once. In 1854 George Boole wrote it as x(1 − x) = 0 and called it the principle "which Aristotle has described as the fundamental axiom of all philosophy" (Boole, 1854). His key law was xx = x, today's idempotent law. In 1864 Jevons made plus mean inclusive OR, and that gave A + A = A.

In the 1930s Claude Shannon and two other engineers showed that the same laws describe switches: series is AND, parallel is OR. So a law makes a circuit smaller without changing its output. The Teachers' Guide gives this as the reason: simplification "reduces the number of operations and number of logic gates" (Teachers' Guide 4.2, page 99) (ගුරු අත්පොත 4.2, පිටුව 110). 2026 P-I Q11 shows it: AB + AB' + AC is just A, so five gates become one wire. That is our own worked answer, not official.

Learn each law with its origin and one sentence of meaning, then check it in two cases. The full history, the four ways the papers ask the laws, and the origin of each law are in an Explained post.

මේ Spark එක බෙදාගන්න

A/L ICT කරන යාළුවෙකුට යවන්න.

තවත් Sparks

  1. English

    Layer 2 and Layer 3 switches 101

    A Layer 2 switch forwards frames by MAC address inside one LAN, and a Layer 3 switch also routes packets by IP address between networks. Why both exist, where they work today, and the past paper questions that test them.

  2. English

    Planning an A/L ICT second attempt

    A low 2026 A/L ICT result is a map of gaps, not an end. Six units carry 73.4% of the marks, and every paper for the plan is free on this site.

  3. English

    Sequential search in Python 101

    A sequential search returns inside the loop on a match and gives the not found value only after the loop. 2026 Paper II Q9(c) shows where that line goes.

All Sparks