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

Prove a Boolean law in two cases

Every Boolean variable is 0 or 1, so any law can be checked in two quick cases. Students can rebuild the Unit 4 laws in seconds instead of memorizing them.

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

A Boolean variable can only be 0 or 1, so any Boolean law in Unit 4 can be checked in two cases. This is faster than learning the laws only as a list of names. Take A + AB = A. Put A = 0: the left side is 0 + 0.B = 0, and the right side is 0. Put A = 1: the left side is 1 + 1.B = 1, and the right side is 1. Both cases agree, so the law is true for every B.

This is not a trick. It is Boole's expansion theorem, also called the Shannon expansion, and it is outside the syllabus (Boole's expansion theorem). The Teachers' Guide proves each law with a full truth table, which is the same idea with every row written out (Teachers' Guide 4.2, pages 99 to 102) (ගුරු අත්පොත 4.2, පිටු 110 ඉඳන් 113). It ends each proof with "Above highlighted columns are identical", and the Sinhala Guide writes "ඉහත ඉස්මතු කරන ලද තීරයන්හි අගයන් සමාන ව ඇත". Here the plus sign means OR, so 1 + 1 = 1. That is why A + A = A and 1 + A = 1 look wrong in school algebra but are true here.

When a law is forgotten, test it in two cases before using it. Boolean algebra laws from the ground up shows why each law is true and how to see which law to use next.

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

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

මේ ලිපියට link කරන ලිපි

  1. English

    Boolean simplification for MCQs with the lone letter rule

    One reason behind most Boolean simplification steps, four moves built on it, and the method worked on 11 real A/L ICT MCQs from 2011 to 2026, each checked against its key.

  2. English

    Where Boolean laws came from and why exams ask them

    The history of the Boolean laws from Aristotle to Boole, Shannon and modern chips, why circuits need the laws, how A/L ICT papers ask them, and how to learn each law from its origin instead of a memorized list.

තවත් 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