Quick answer for parents: G3 Computing tuition can help when it trains your child to translate between a Boolean statement, a gate diagram and a truth table—then use De Morgan’s theorem as a transformation that can be checked, not as a chant to memorise.
Try this first: ask your child to explain why NOT (A AND B) has the same output as (NOT A) OR (NOT B) for all four possible pairs of inputs. If they can recite the rule but cannot verify it row by row, the learning gap is proof and representation, not memory.
Start tuition with one diagnostic set covering the original statement, its transformed form, the two truth tables and the matching circuit. That small comparison usually reveals whether the difficulty lies in brackets, negation, gate symbols or systematic checking.
On this page: diagnose the error · use a reliable method · work an example · practise for transfer · check syllabus fit · know the limits · measure independence
Did you know the wrong answer may begin before De Morgan’s theorem?
A student may reverse AND and OR correctly yet still lose the negation on one input, overlook a bracket, or read a NAND symbol as an AND gate. Another may draw a correct circuit but build a truth table in a random order, making it hard to compare outputs. These are different problems and need different teaching.
- Notation gap: the student cannot see which part of the expression is negated.
- Representation gap: the student knows the words but cannot move between statement, circuit and table.
- Procedure gap: the student changes the operator but forgets to negate both inputs.
- verification gap: the student treats a familiar-looking answer as proof.
A useful diagnostic asks the student to speak while working. “What is inside the NOT?” and “Which rows would make the original AND true?” reveal more than another mark on a worksheet.
A four-move method makes the transformation visible
- Mark the scope. Box the complete expression controlled by the outside NOT.
- Change the connector. AND becomes OR; OR becomes AND.
- Negate every input inside that scope. No input is allowed to disappear.
- Verify equivalence. Evaluate the original and transformed expressions for the same input combinations.
This sequence prevents the common shortcut “flip the gate and hope”. Once it is secure, the tutor can vary the representation: begin with a circuit on one question, a Boolean statement on the next and an incomplete truth table on the third. The rule stays the same while the surface changes.
If a provider genuinely offers G3 Computing in a three-student group, the small format can be useful: one student explains the scope of the NOT, another predicts the transformed gate, and the third audits the truth-table rows. The tutor should still record each learner’s own error pattern and require an individual final solution.
Example: prove, do not merely announce, the equivalence
Take NOT (A AND B). The outside NOT covers the whole AND expression. De Morgan’s theorem changes AND to OR and negates both inputs, giving (NOT A) OR (NOT B).
- When A and B are both true, A AND B is true, so its negation is false. On the transformed side, both negated inputs are false, so the OR is false.
- For every other pair of inputs, A AND B is false, so the original expression becomes true. At least one transformed input is then true, so the OR is also true.
The two outputs agree for every row. That agreement is the reason the expressions are equivalent. Now compare the companion form: NOT (A OR B) = (NOT A) AND (NOT B). The operator changes in the other direction, but the same four-move method works.
Practice should connect the representations
A productive practice cycle is short and mixed. First transform two statements. Next draw one matching gate diagram. Then complete one truth table in the regular input order. Finally, explain one incorrect worked solution. This is more revealing than twenty identical substitutions because the student must recognise the same logic in several forms.
The tutor can gradually remove prompts: no highlighted brackets, no reminder to negate both inputs, and eventually no request to construct a truth table. The student chooses the check. A weekly return to an older question protects continuity so the skill is still available after a new module begins.
How this aligns with the 2027 G3 Computing syllabus
The official 2027 SEC G3 Computing syllabus K349 requires students to convert between logic-circuit diagrams and Boolean statements, construct truth tables for circuits with up to three inputs, use AND, OR, NOT, NAND, NOR and XOR gates, and manipulate Boolean statements using associative and distributive properties and De Morgan’s theorem. It also expects students to solve system problems using combinations of gates with up to three inputs.
For 2027, Paper 1 is a two-hour written paper worth 60%, while Paper 2 is a two-hour-30-minute lab-based examination worth 40% and focuses on spreadsheets plus algorithms and programming. De Morgan’s theorem belongs to the written-paper breadth, but the checking habits it develops—careful scope, systematic cases and explicit verification—also support computational thinking elsewhere.
G3 is the subject level, not the student’s Posting Group. Confirm the subject and level actually offered by the school, and confirm that any tutor genuinely supports the current K349 syllabus before enrolling.
What tuition cannot replace
Tuition cannot replace school instruction, current school materials or the student’s own reasoning. It should not narrow Computing to one theorem, either: the official syllabus spans computing fundamentals, algorithms and programming, spreadsheets, networking and the impact of computing. A student who can simplify one expression but cannot interpret a circuit still needs broader consolidation.
Good support also avoids invented exam promises. The useful question is whether the student can explain and verify unfamiliar logic, not whether a tutor claims that a particular question will appear.
Three signs your child is becoming independent
- They mark the scope of a negation without being prompted.
- They can derive the transformed expression and justify it with selected truth-table rows.
- They catch a missing negation or wrong operator in somebody else’s working and explain the correction.
A sensible exit check is a fresh three-input problem one week later. If the student can choose a representation, complete it accurately and explain why the result is equivalent, support can move to occasional review.
Useful next reading: choosing normal, boundary and invalid test data, or return to the MOE and SEAB syllabus guide directory.

