අන්තර්ගතයට යන්න
mcqdinethlive

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.

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

This post gives one method for Boolean simplification MCQs in Unit 4 and tests it on real past paper questions. The method rests on one reason. Students who keep that reason can rebuild each step in the exam hall, without a memorized list of law names.

The post has five parts:

  • Why the method works: what "simplest" means in an MCQ, and the lone letter rule with its reason (sections 1 and 2).
  • The method: four moves and one fallback (section 3).
  • The method on past papers: algebra MCQs, Karnaugh map MCQs and De Morgan MCQs, each checked against its key (sections 4 to 6).
  • The method in Paper II: how each move becomes named laws (section 7).
  • Practice: past paper questions to try (section 8).

How to read the expressions. The papers print NOT A as A with a bar over it. This post writes it as A', as both Teachers' Guides do in their worked examples (Teachers' Guide 4.2, page 102) (ගුරු අත්පොත 4.2, පිටුව 113). AB means A AND B. A + B means A OR B.

1. What simplest means in an MCQ

The simplest expression is the one with the fewest letters among the expressions that are equal to the given one. Two expressions are equal when they give the same output in every row of the truth table. So an MCQ on simplification has two filters, in this order: first equal, then short.

Why simplification matters

Fewer letters mean fewer gates. The Teachers' Guide says that simplification "reduces the number of operations and number of logic gates" (Teachers' Guide 4.2, page 99). The Sinhala Guide says "අවශ්‍ය කරන පියවර ගණන සහ තාර්කික ද්වාර ගණන, අඩු කර ගත හැකිය" (ගුරු අත්පොත 4.2, පිටුව 110). The syllabus asks students to describe "the need for simplifying Boolean expressions", and to simplify with Boolean theorems and the Karnaugh map (Syllabus 4.2, pages 12 and 13) (විෂය නිර්දේශය 4.2, පිටු 12 සහ 13).

The trap in the shortest option

The shortest option is often wrong. Examiners put a short expression among the options that is not equal to the given one. They also put longer expressions that are equal but not simplest. In 2020 Paper I, Q9, four of the five options are equal to the given expression, and the shortest option is the one that is not equal (section 4). So check "equal" before "short".

2. The lone letter rule

When one letter stands alone as a whole term of an OR, the other terms matter only in the rows where that letter is 0. So, inside the other terms, that letter can be written as 0. This is the lone letter rule. It is the base of the whole method.

The rule in four lines

The rule has an OR form and an AND form. "The rest" means all the other terms (in an OR) or all the other factors (in an AND).

  • A + rest: inside the rest, put A = 0.
  • A' + rest: inside the rest, put A = 1.
  • A.rest: inside the rest, put A = 1.
  • A'.rest: inside the rest, put A = 0.

After that, clean up the constants: 1' = 0, 0' = 1, X.1 = X, X.0 = 0, X + 0 = X and X + 1 = 1.

Why the rule works

An OR gives 1 as soon as one of its terms is 1. When A = 1, the whole expression A + rest is already 1, and the rest cannot change it. So the rest decides the output only in the rows where A = 0. In those rows, every A inside the rest really is 0. Writing 0 there changes nothing that matters.

The AND form is the mirror. An AND gives 0 as soon as one factor is 0. When A = 0, A.rest is already 0. So the rest decides the output only in the rows where A = 1.

In switches, an OR is two switches in parallel, and an AND is two switches in series. A closed switch in parallel keeps the lamp on. An open switch in series keeps it off. Either way, the other switches only matter in one position of A.

Students can check the rule in two cases, as in Prove a Boolean law in two cases. Take A + A'B and A + B. With A = 1, both are 1. With A = 0, A'B is B, so both are B.

One rule gives six laws

The lone letter rule produces six results that students usually learn as separate laws.

  1. A + AB: put A = 0 in AB. It becomes 0.B = 0. So A + AB = A. This is redundancy form 1 (Teachers' Guide 4.2, page 102) (ගුරු අත්පොත 4.2, පිටුව 113).
  2. A + A'B: put A = 0 in A'B. It becomes 1.B = B. So A + A'B = A + B. This is redundancy form 2 (Teachers' Guide 4.2, page 102) (ගුරු අත්පොත 4.2, පිටුව 113).
  3. A(A + B): put A = 1 in the bracket. It becomes 1 + B = 1. So A(A + B) = A.
  4. A(A' + B): put A = 1 in the bracket. It becomes 0 + B = B. So A(A' + B) = AB.
  5. A + A': put A = 0 in A'. It becomes 1. So A + A' = 1, the complement law.
  6. A.A': put A = 1 in A'. It becomes 0. So A.A' = 0, the complement law again.

A term inside a longer term

The same reason removes a whole term. In XY + XYZ, the term XYZ can be 1 only when XY is already 1. So XYZ adds nothing, and XY + XYZ = XY. The rule: when every letter of one term is inside another term, delete the longer term. Line 1 above is the smallest case of this.

3. Four moves and one fallback

The method is four moves in a fixed order, and each move has the reason from section 2 or a reason just as short. Students use the moves in order, and go back to move 2 whenever a new lone letter appears.

  1. Open the bars. Use De Morgan's laws until every bar sits on a single letter: break the bar and change the sign (Teachers' Guide 4.2, page 100) (ගුරු අත්පොත 4.2, පිටුව 111). Two bars on one letter cancel. The reason: the lone letter rule needs to see single letters.
  2. Use lone letters. For each lone letter, put its value into the other terms (section 2), then clean up. Delete any term that holds a shorter term.
  3. Join twins. Two terms that are the same except for one letter, plain in one term and barred in the other, join into one term without that letter: XY + XY' = X. The reason: the output is 1 for both values of Y, so Y carries no information. After a join, look for a new lone letter and go back to move 2.
  4. Test a row. Put one row of 0s and 1s into the expression and into each option. Throw out every option that gives a different output. Pick a row where the options disagree. Then, among the options left, choose the one with the fewest letters. With three letters there are only 8 rows, so a full check is quick.

The fallback is a split on one letter

When no letter is lone and no twins appear, split the expression on one letter. Write F = A.(F with A = 1) + A'.(F with A = 0). Each half is now short, and the lone letter rule usually works on the result. This split is called Boole's expansion theorem, or the Shannon expansion. It is outside the syllabus, and it is the same two-case idea as the two-case proof (Boole's expansion theorem). Section 4 uses it on 2013 Paper I, Q1.

4. Algebra MCQs from past papers

The method solves all six algebra MCQs below, and each answer matches the key. The key source is given with each question: the official marking scheme of the Department of Examinations, a third-party copy of a scheme, or our own worked answer where no scheme is available. Every answer was also checked against the full truth table.

2022 (held 2023) Paper I Q10

2022 (held 2023) Paper I, Q10 asks for a simplified form of X + X'Y (4.2).

  1. X is a lone letter of the OR. Put X = 0 in X'Y. It becomes 1.Y = Y.
  2. So X + X'Y = X + Y. This is option (5).

The key is (5), from a third-party copy of the marking scheme. Option (3), XY, is the trap: it fails at X = 1, Y = 0, where the expression gives 1.

2023 (held 2024) Paper I Q13

2023 (held 2024) Paper I, Q13 asks for the simple form of X(X' + Y).

  1. X is a lone factor of the AND. Put X = 1 in the bracket. It becomes 0 + Y = Y.
  2. So X(X' + Y) = XY. This is option (3).

The key is (3), from a third-party copy of the official key. This question is the AND mirror of the 2022 question.

2026 Paper I Q11

2026 Paper I, Q11 asks which expression equals AB + AB' + AC.

  1. AB and AB' are twins that differ only in B. They join to A (move 3).
  2. Now the expression is A + AC. A is lone, so put A = 0 in AC. It becomes 0 (move 2).
  3. So the expression equals A. This is option (1).

No official marking scheme for 2026 is available yet, so (1) is our own worked answer, not official. The full truth table agrees: the expression is 1 exactly when A is 1.

2020 Paper I Q9

2020 Paper I, Q9 asks for the most simplified expression equal to AB'C' + BC' + A'B'C + BC.

  1. BC' and BC are twins that differ only in C. They join to B (move 3).
  2. Now B is lone. Put B = 0 in the other terms. AB'C' becomes AC', and A'B'C becomes A'C (move 2).
  3. So the expression equals AC' + A'C + B. This is option (4), with 5 letters.

The official key is (4). This question shows the trap from section 1. Options (1), (2) and (3) are also equal to the expression, but they have 7, 6 and 8 letters. Option (5), A'C' + B, is the shortest, with 3 letters, but it is not equal. Test the row A = 1, B = 0, C = 0: the expression gives 1 from the term AB'C', and option (5) gives 0.

2011 Paper I Q27

2011 Paper I, Q27 (old syllabus) asks for the result of simplifying (x + y)'(x' + y')' with De Morgan's law.

  1. Open the bars (move 1). (x + y)' becomes x'y', and (x' + y')' becomes xy. The expression is x'y'xy.
  2. x is a lone factor of the AND. Put x = 1 in the other factors. x' becomes 0, so the whole product is 0 (move 2).
  3. The answer is 0, option (3).

The key is (3), from a third-party copy of the marking scheme.

2013 Paper I Q1

2013 Paper I, Q1 (old syllabus) asks what (x + y)(x + z) simplifies to. No letter is lone, and there are no twins, so use the split on x.

  1. With x = 1, the expression is (1)(1) = 1. With x = 0, it is yz.
  2. So the expression is x.1 + x'.yz = x + x'yz.
  3. Now x is lone. Put x = 0 in x'yz. It becomes yz (move 2).
  4. The answer is x + yz, option (4).

The key is (4), from a third-party copy of the marking scheme. The Teachers' Guide reaches the same result in six named steps in its E.g. 02 (Teachers' Guide 4.2, page 102) (ගුරු අත්පොත 4.2, පිටුව 113).

5. Karnaugh map MCQs

A Karnaugh map MCQ is the same method in a picture: a block of 1s where one letter does not change is a lone letter. So write the biggest block first as a lone letter, write the cells left over as terms, and use the lone letter rule on them. The Teachers' Guide says that Karnaugh maps "provide an alternative way of simplifying logic circuits" (Teachers' Guide 4.2, page 105) (ගුරු අත්පොත 4.2, පිටුව 116).

How to read a block

A block of cells gives the letters that stay the same across it. In a three-variable map, a block of four cells keeps one letter fixed, so it is a single letter. A block of two cells keeps two letters fixed. One cell keeps all three. The columns go 00, 01, 11, 10, so that neighbours differ in only one letter. That order puts twins next to each other, so a loop of two cells is a move 3 join done by eye. The first and last columns are neighbours too, which is why groups may wrap around (Teachers' Guide 4.2, page 106) (ගුරු අත්පොත 4.2, පිටුව 116).

2024 Paper I Q14

2024 Paper I, Q14 gives a map with columns xy = 00, 01, 11, 10. Row z = 0 reads 0, 1, 1, 1. Row z = 1 reads 0, 1, 1, 0. It asks for the simplest expression.

  1. The four cells under xy = 01 and 11 are all 1. In both columns y = 1, so this block is the lone letter y.
  2. One 1 is left: x = 1, y = 0, z = 0. That cell is the term xy'z'.
  3. So the expression is y + xy'z'. y is lone, so put y = 0 in xy'z'. It becomes xz'.
  4. The answer is y + xz', option (5).

The key is (5), from a third-party copy of the marking scheme. A Karnaugh map loop gives the same result, if the left-over cell is looped with its neighbour at xy = 11. The lone letter rule reaches it without a search for that loop.

2025 Paper I Q14

2025 Paper I, Q14 gives a map with the same columns. Row z = 0 reads 1, 0, 0, 1. Row z = 1 reads 1, 0, 1, 1. It asks for the simplest expression.

  1. The columns xy = 00 and 10 are all 1. In both, y = 0. They are neighbours by wrap-around, so this block is the lone letter y'.
  2. One 1 is left: x = 1, y = 1, z = 1, the term xyz.
  3. So the expression is y' + xyz. y' is lone, so put y = 1 in xyz. It becomes xz.
  4. The answer is y' + xz, option (3).

The official key is (3). Option (4), y' + xyz, is equal but not simplest: it is step 3 before the lone letter rule. Option (1), y', is shorter but not equal, because it leaves out the cell at x = 1, y = 1, z = 1.

6. De Morgan MCQs and one key to question

De Morgan MCQs test move 1 most. Open the bars step by step, and keep each line: an option that matches any line is equal. The row test of move 4 settles every doubt.

2024 Paper I Q13

2024 Paper I, Q13 asks what the double complement and De Morgan's theorem give when they are applied to x' + yz.

  1. Put two bars over the whole expression. Two bars cancel, so nothing changes: ((x' + yz)')'.
  2. Open the inner bar with De Morgan: (x' + yz)' becomes x.(yz)'.
  3. So the expression is (x.(yz)')'. This is option (4).

The key is (4), from a third-party copy of the marking scheme. A row test agrees: with x = 1, y = 0, z = 0, both the expression and option (4) give 0.

2018 Paper I Q21

2018 Paper I, Q21 (old syllabus) asks which of three expressions equal (A + BC')'.

  1. Open the outer bar: A'.(BC')'.
  2. Open the inner bar: A'(B' + C), because (C')' is C.
  3. Expand: A'B' + A'C.

Now compare the statements. Statement II is A'.(BC')', which is line 1. Statement III is A'B' + A'C, which is line 3. Statement I is A' + B'C, and it fails the row A = 0, B = 1, C = 0: the expression gives (0 + 1)' = 0, but statement I gives 1. So the statements that are equal are II and III, which is option (5).

2019 (Old Syllabus) Paper I Q37

2019 (Old Syllabus) Paper I, Q37 asks which option equals (A' + B)(AC)'.

  1. Open the bar: (AC)' becomes A' + C'. The expression is (A' + B)(A' + C').
  2. Split on A. With A = 0, both brackets are 1, so the result is 1. With A = 1, the result is B.C'.
  3. So the expression is A' + ABC', and the lone letter rule turns it into A' + BC'.

No option equals A' + BC'. The row A = 0, B = 0, C = 0 shows this fast: the expression gives 1, and all five options give 0. The official scheme gives "all" for this question, so every answer received the mark. The method explains why.

7. From moves to Paper II law names

Each move is a short chain of the Teachers' Guide laws, so a Paper II answer writes that chain with the law names. Paper II "show that" questions need the names; MCQs do not.

  • Open the bars: De Morgan's Law, then the double complement law ("Double Inverse" in the Guide's SOP and POS examples) (Teachers' Guide 4.2, pages 100 and 105) (ගුරු අත්පොත 4.2, පිටු 111 සහ 116).
  • A lone letter in an OR, such as A + A'B: Redundancy Law, form 2 (Teachers' Guide 4.2, page 102) (ගුරු අත්පොත 4.2, පිටුව 113).
  • A term inside a longer term, such as A + AB: Redundancy Law, form 1.
  • A lone letter in an AND, such as A(A' + B): Distributive Law, then Inverse Law, then Identity Law. A(A' + B) = AA' + AB = 0 + AB = AB.
  • Join twins: Distributive Law, then Inverse Law, then Identity Law. XY + XY' = X(Y + Y') = X.1 = X.
  • Split on a letter: there is no single law name for it. In Paper II, use the distributive steps of the Teachers' Guide's E.g. 02 instead (Teachers' Guide 4.2, page 102) (ගුරු අත්පොත 4.2, පිටුව 113).

One MCQ written with law names

2026 Paper I, Q11, written as a Paper II chain:

  1. AB + AB' + AC = A(B + B') + AC by the Distributive Law.
  2. = A.1 + AC by the Inverse Law.
  3. = A + AC by the Identity Law.
  4. = A by the Redundancy Law, form 1.

8. Past paper questions to try

These questions use the same moves. The answers are not in this post. The moves in brackets are the ones each question needs most.

  • 2012 Paper I, Q26 (old syllabus): a product with a barred pair and a bracket that is always 1 (moves 1 and 2).
  • 2014 Paper I, Q12 (old syllabus): a three-input circuit to replace with a simpler circuit (write its expression first, then use the moves).
  • 2019 (New Syllabus) Paper I, Q39: read grouped blocks of a Karnaugh map (section 5).
  • 2021 (held 2022) Paper I, Q9: the map cells of a circuit for AB + C (section 5).
  • 2024 Paper II, B, Q5(b): the simplest form of an expression (moves 2 and 3).
  • 2022 (held 2023) Paper II, B, Q5(b)(i): show that four terms equal three shorter terms (section 7).
  • 2023 (held 2024) Paper II, B, Q5(b): show that four terms equal two terms (moves 2 and 3, then section 7).
  • 2025 Paper II, B, Q5(a): show that six four-variable terms equal three terms (moves 2 and 3, then section 7).
  • 2026 Paper II, B, Q5(b): show that four terms equal a grouped form, by simplifying the left side (section 7).

Sources outside the syllabus

The syllabus, the Teachers' Guide pages and the past papers are cited in the text. The past papers and marking schemes are the G.C.E. (A/L) ICT question papers and marking schemes of the Department of Examinations, Sri Lanka. These are the other sources:

  • Claude E. Shannon, "A Symbolic Analysis of Relay and Switching Circuits", Transactions of the AIEE, 1938. DSpace@MIT.
  • Boole's expansion theorem (Shannon expansion). Wikipedia.
  • Absorption law. Wikipedia.
  • Karnaugh map, from Maurice Karnaugh, "The Map Method for Synthesis of Combinational Logic Circuits", Transactions of the AIEE 72(1), 1953. Wikipedia.
  • Gray code, the order of the map's rows and columns. Wikipedia.

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

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

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

  1. English

    Boolean simplification in four moves

    One reason, the lone letter rule, explains most Boolean simplification steps in Unit 4 MCQs, and four moves built on it solve the past paper questions.

තවත් Explained

  1. Layer 2 vs Layer 3 switch differences and real uses

    How a Layer 2 switch and a Layer 3 switch differ, why each exists, where networks use them now and next, and the A/L ICT past paper questions that test them, with answers.

    Englishපියවර 7ක්
  2. A/L ICT second attempt study plan for 2027 by unit weight and past papers

    A study plan for students who sit A/L ICT again in 2027. It covers the 2026 results, the units that carry most marks, a lesson method with past papers, a month by month timeline and the free papers on this site.

    Englishපියවර 7ක්
  3. Python functions with lists of tuples and sequential search in 2026 Paper II Q9

    2026 Paper II Q9 worked part by part. The fine rule and its two readings, a function with if and elif, a list of tuples built with a loop, a sequential search that returns -1, and the same skills in Paper I.

    Englishපියවර 7ක්
All Explained