How G1 Mobile Robotics Logic Gates and Truth Tables Work

G1 Mobile Robotics K130 in the 2027 SEAB school-candidate listing includes digital logic gates, Boolean expressions, truth tables and Karnaugh maps with no more than three inputs. These ideas explain how simple combinations of signals make a robot take one action instead of another. Students should learn what every input and output means before trying to remember logic symbols.

An important qualification detail comes first: although K130 appears on the SEC-era G1 syllabus directory, the individual 2027 PDF states that Mobile Robotics is examined for Joint MOE–ITE Applied Subject Certification, not the Singapore-Cambridge SEC. SEAB states that 2027 is the final examination year for this group, and only approved schools can offer it. This article is an SEC-era guide to the subject, not a claim that its joint certificate is an SEC grade.

The assessment has a one-hour written paper worth 30%, a control-circuit practical worth 30%, and a robot-integration practical worth 40%. Digital logic can help students interpret a specified control task, but no online explanation replaces the school’s supervised practical training. The examples below are paper-based and do not give wiring instructions.

2027 G1: quick answers

The K130 Digital Electronics topic includes AND, OR and NOT gates, Boolean expressions and truth tables with at most three inputs.
AND requires all named conditions to be true; OR requires one or more; NOT reverses a binary condition.
Two inputs have four possible combinations. Three inputs have eight combinations.
A truth table lists what the output should be for each input combination.
Karnaugh maps in K130 are limited to three inputs; simplified expressions must agree with the original truth table.
Paper 1: 30 marks, 30%, 1 hour. Paper 2: 42 marks, 30%, 1h 30m. Paper 3: 80 marks, 40%, 2h.
Only approved-school candidates may take the joint MOE–ITE applied subject in its stated final 2027 examination year.

Official documents: 2027 K130 syllabus (SEAB) and 2027 SEAB G1 school-candidate subject directory. This is independent education commentary.

First understand the qualification
The three examined papers
How the concepts work
Original worked examples
Common mistakes
Four-week study plan
Advice for parents and tutors
Frequently asked questions
Official sources and further reading

What G1 Mobile Robotics K130 actually represents

The K130 syllabus is a G1 MOE–ITE Applied Subject for a two-year upper-secondary course. The official PDF expressly says it is for Joint MOE–ITE Applied Subject Certification, not the Singapore-Cambridge SEC itself. SEAB lists it under a separate applied-subject heading in the 2027 G1 school-candidate directory; entry is confined to approved schools.

SEAB also identifies 2027 as the last examination year for the three subjects Mobile Robotics, Smart Electrical Technology and Retail Operations. This fact does not eliminate technical learning or establish a specific replacement course. Families should confirm their child’s actual school programme and candidate entry before purchasing specialist preparation materials.

2027 K130: official examination format

Paper	Timing and weighting	Skills required
Paper 1	30 marks; 1 hour; 30%	Compulsory multiple-choice written paper testing understanding and application.
Paper 2	42 marks; 1 hour 30 minutes; 30%	Interpret a given schematic and connect a control circuit under supervised examination conditions.
Paper 3	80 marks; 2 hours; 40%	Integrate and test a mobile robot with a supplied subsystem.
Digital Electronics module	AND/OR/NOT, truth tables and Karnaugh mapping	Truth tables and Karnaugh maps have a maximum of three inputs in the syllabus.
Certification and eligibility	Joint MOE–ITE; approved schools only	Not the SEC award, despite placement in the G1 school-candidate catalogue; final year 2027.

Written learning and practical competence are different achievements. The published practical papers require the candidate’s own supervised work in the approved school laboratory or training environment. Nothing in an independent online study guide authorises household electrical work, bypassing safety systems or creating the examination product for the candidate.

How G1 Mobile Robotics concepts work

The explanations below use theoretical quantities and safe paper exercises. They teach what a decision means before asking for speed, and they distinguish an idealised classroom model from real equipment behaviour.

Start with a decision expressed in ordinary language

A robot’s controller has to answer a question: should it turn, stop, warn or continue? The decision can be expressed as a simple statement before drawing any electronic logic. If a fictional machine should activate an indicator only when it detects darkness and movement, the word ‘and’ tells us about the required combination of conditions.

Write the rule in one short sentence. Name input A as ‘darkness detected’, input B as ‘movement detected’ and output Y as ‘indicator on’. Then test each possible pair of input states. This is a reasoning exercise about an abstract system, not a design for a real safety device.

Understand why binary values are only two states

Digital logic often models inputs as 0 or 1. These are symbolic states, not a universal statement that every physical sensor provides exactly 0 or 1 without conversion. The meaning of 0 and 1 must be defined for the particular control problem.

For a classroom paper example, specify 1 = obstacle detected and 0 = no obstacle detected. Without that definition, a truth table can be calculated correctly but interpreted backwards. The label is part of the solution.

AND: every stated condition must hold

An AND gate produces 1 only when both binary inputs are 1. It does not mean ‘these two things happen one after another’; it means the required conditions are simultaneously true for that particular decision.

Make a table for A and B. When A=0, B=0, output is 0. When only one is 1, output remains 0. Only A=1 and B=1 produces 1. Ask what the output means in words rather than memorising four digits.

OR: at least one condition is sufficient

An OR gate outputs 1 if either input is 1, including the case where both are 1. Many learners confuse OR with ‘exactly one’. Standard OR is inclusive; exactly one is a different logical relationship.

Imagine a fictional warning should appear when sensor A or sensor B reports a hazard. Complete 00→0, 01→1, 10→1 and 11→1. Explain why 11 still activates the output.

NOT reverses one binary input

NOT takes a single input and returns its opposite. It is a useful way to express a ‘no’ condition, but the meaning must come from the defined input. A 0 may indicate a clear path or a missing signal depending on the system.

If A means ‘door is closed’, NOT A can mean ‘door is not closed’ in the simplified classroom model. This does not prove a real door is physically safe or unsafe; a practical system needs suitable sensing and reliability considerations.

A truth table is an exhaustive list, not a guess

For two independent binary inputs, there are four possible combinations: 00, 01, 10 and 11. For three, there are eight. Missing one row can hide an error and leave the output behaviour uncertain.

Practise writing the input combinations systematically before calculating anything. With A, B and C, use 000 through 111 in binary order, then compute the output in each row. Check that none is duplicated or omitted.

Use clear Boolean notation

Boolean expressions describe relationships among logical inputs. A·B commonly means AND, A+B commonly means OR in Boolean notation, and a bar or prime can show NOT. The symbols do not have exactly the same meaning as ordinary arithmetic plus and multiplication.

Translate a simple rule ‘A and not B’ into A·B′ using the teacher’s notation convention. Read it back as an English sentence. Avoid calculating 1+1=2 in Boolean OR, where the output remains 1.

Order and grouping can change the decision

Two expressions that contain identical letters may mean different things when parentheses or NOT apply in different places. The student should follow the structure of the given circuit or expression rather than scan for familiar symbols.

Compare A·(B+C) with A·B+C. Set A=0 and C=1. The first expression is 0; the second becomes 1. A small counterexample reveals why parentheses matter.

Draw a logic circuit from its meaning

K130 includes moving between Boolean expressions and circuits. The educational skill is connecting which signals feed which operation and identifying the final output. A diagram is a representation of the decision rule, not simply a decorative collection of gate symbols.

Start with a teacher-provided abstract expression such as (A·B)+C. Describe that A and B combine first, then their result is combined with C through OR. Draw only the logical block relationship in an unpowered paper exercise.

Trace a circuit back into an expression

Students may receive a diagram and be asked what it computes. Work from inputs toward the output, naming each intermediate result. Guessing the final answer from the number of gates can miss a NOT or a later combination.

Label the first intermediate output X=A·B, then suppose the final result is X+C. Substitute to obtain (A·B)+C. Test selected input combinations to verify the translation.

Why three-input tables matter

With three binary inputs, a student must consider eight combinations. Skipping ‘rare-looking’ combinations is a mistake because the output rule must be valid for every input state, not just familiar examples.

Write the input headings A, B and C and list 000, 001, 010, 011, 100, 101, 110 and 111. For the illustrative rule Y=A·B+C, Y is 1 when C=1 or both A and B are 1. Check each row without assuming a pattern.

Simplification is allowed only if the output stays the same

A shorter Boolean expression is useful when it is equivalent to the original, but a shorter formula is not automatically correct. Logic simplification must preserve the output for every combination of inputs.

Compare two candidate expressions by filling the complete truth table. If one row differs, they are not equivalent. This is a rigorous checking habit and avoids replacing proof with familiarity.

Karnaugh maps organise adjacent combinations

A Karnaugh map lays out truth-table outputs so logically adjacent cases can be grouped. For three-input K130 problems, the grouping helps identify simpler Boolean terms. The syllabus explicitly caps Karnaugh mapping at three inputs.

Practise mapping a complete eight-row truth table into a teacher-provided three-variable Karnaugh-map grid. Check the input ordering first; a wrong Gray-code ordering will create misleading groupings.

Group cells based on valid adjacency

Cells in a Karnaugh map can be adjacent across an edge according to the map’s variable ordering; a student who groups any visually convenient cells may produce an invalid term. The group should cover valid adjacent 1s for a sum-of-products simplification.

Use a pre-labelled paper map to compare one valid pair with a diagonal pair. Explain why the diagonal is not a one-variable adjacency. Do not memorise map shapes without linking them to input changes.

Check Karnaugh-map answers against the truth table

Even after grouping apparently correctly, the derived expression may omit a case. Testing the result against all eight combinations is a reliable diagnostic method, especially when several groups overlap.

Take the simplified expression and calculate its output for the original eight input rows. If any output is inconsistent, return to the group selection or expression translation rather than invent a special exception.

Digital logic supports the larger robot system

A robot involves sensors, control logic, power and actuators. An abstract truth table alone cannot tell us whether a motor has the correct electrical drive or whether the robot is mechanically stable. K130 tests practical integration separately.

Draw a high-level input–control–output diagram for a fictional robot. Explain where the logic decision fits and which practical questions remain unknown. The school handles actual control-circuit construction, component ratings and safe testing.

Safety must not be inferred from a truth table

An ideal binary model might say a hazard is absent, but an actual sensor can fail, be misaligned or lack power. Teaching logic cannot be used as a substitute for safety engineering or formal testing of a real machine.

Ask a conceptual question: What if the sensor returns no valid measurement? The paper model may need additional assumptions. In genuine lab work, stop and follow school safety procedures rather than improvising bypasses.

Use an error log that names the wrong logical step

Some students confuse OR with exclusive OR; others list seven rows instead of eight, mishandle parentheses or use a wrong Karnaugh-map adjacency. ‘I am bad at electronics’ is not an actionable diagnosis.

Review one error, name the exact rule that failed and test a changed question with the same logical pattern. This creates more reliable improvement than copying twenty gate symbols.

Original worked learning examples

All calculations and control situations are original teaching illustrations. They are not authentic examination tasks, and they do not instruct a learner to modify electrical equipment.

Example 1 — a two-input permission rule

A fictional device may display READY only when A=1 (‘task approved’) and B=1 (‘equipment available’). Complete its AND truth table.

00→0, 01→0, 10→0 and 11→1. The result is a classroom decision model, not a real industrial interlock.

Example 2 — inclusive OR in a warning system

An imaginary robot uses A for an obstacle on the left and B for an obstacle on the right. A conceptual warning indicator should activate if one or both detections are present.

The OR output is 0 only at A=0,B=0. It remains 1 when both detections are present, because inclusive OR accepts either or both.

Example 3 — parentheses change an expression

Compare Y1=A·(B+C) and Y2=(A·B)+C. Evaluate both at A=0,B=0,C=1.

Y1=0 and Y2=1. That one input combination proves the expressions are not equivalent. A student can check other rows to understand the full difference.

Example 4 — a three-input output rule

A practice expression is Y=(A·B)+C. Interpret the rule: activate when C is present, or when A and B are both present.

Make the full eight-row table. Y is 1 in every row where C=1 and also for A=1,B=1,C=0. It is 0 in rows 000,010,100. Explain the decision in words.

Common mistakes and targeted corrections

Observed mistake	What it reveals	Targeted repair
Treats OR as exactly-one-input	Inclusive OR is misunderstood	Verify output 1 when both A and B equal 1.
Lists only seven combinations for three inputs	Truth table is incomplete	Generate all eight combinations systematically.
Calculates Boolean plus as ordinary addition	Logical notation confused with arithmetic	Read + as OR and keep binary outputs.
Moves a NOT sign to the wrong term	Expression structure was not followed	Mark precisely which variable or group is negated.
Combines diagonally adjacent Karnaugh cells	Map adjacency not understood	Review Gray-code ordering and valid neighbours.
Simplifies to a shorter expression with one wrong output	Equivalence not checked	Recalculate all original rows before accepting the result.
Uses a correct truth table to assume a real robot is safe	Model confused with real-world testing	State sensor assumptions and follow supervised practical procedures.
Memorises paper answers but cannot explain the decision	Symbols disconnected from meaning	Translate every output into an ordinary-language action.

An error is valuable when the teacher can name the first mistaken assumption. Use a short error log and test the corrected idea again with a different input or realistic context. Repetition without diagnosing the cause rarely gives the best return on effort.

A four-week Mobile Robotics learning plan

This plan is a study support cycle and cannot replace the full two-year subject, school-supervised practical work or the released examination instructions. It does not promise a particular grade.

Week 1 — Learn AND, OR and NOT

Explain each gate with ordinary-language examples. Complete several two-input tables, then define what 0 and 1 mean in context.

Week 2 — Combine and translate

Move between simple Boolean expressions, abstract diagrams and full three-input truth tables. Test parenthesis and NOT placement.

Week 3 — Simplify responsibly

Practise small Karnaugh maps using teacher-provided correct layouts. Compare derived expressions with all truth-table rows.

Week 4 — Integrate the reasoning

Review the digital-logic outcome inside a high-level robot system. Complete paper-based MCQs and explain faults conceptually; leave physical wiring to approved school labs.

A short learning-check routine

Recall one concept without notes and define its quantities or conditions.
Try one small unfamiliar paper problem.
Explain the method and its limits, not only the answer.
Identify the earliest wrong step if the result is incorrect.
Revisit the idea after several days and use school feedback to set the next target.

What parents and tutors should do

Ask what the learner can explain independently and what practical conditions the school authorises. Some students need to repair a missing foundation, some need more consistent practice, and some can apply concepts to unfamiliar decisions. Treating these groups identically can waste attention and time.

The immutable eduKateSG Clementi Mathematics tutorial reference supplies the reader-first editorial structure for this series: immediate useful information, underlying principles, mistake diagnosis, short worked illustrations and realistic next steps. The technical details here are independently checked against K130; similar formatting cannot guarantee Google search rankings.

eduKateSG’s three-student tutorials may help with conceptual discussion and checking, but laboratory work and safety remain with the authorised school instructor. No tutor or parent should undertake the candidate’s practical examination on their behalf, and no grade can be promised.

Frequently asked questions

Is K130 an ordinary SEC certificate subject?

No. Its official PDF states Joint MOE–ITE Applied Subject Certification; it appears under the G1 applied-subject category in the SEC-era directory.

What is the maximum number of inputs for K130 truth tables?

Three inputs according to the 2027 syllabus, giving eight input combinations.

Are Karnaugh maps assessed?

The Digital Electronics syllabus includes mapping and simplifying Boolean expressions with no more than three inputs.

Does OR mean exactly one signal?

No. Standard OR is inclusive: it outputs 1 when either or both input signals are 1.

Does correct Boolean logic guarantee a working robot?

No. Practical performance also depends on sensors, wiring, power, mechanical design, testing and safe integration.

How much of K130 is practical?

Paper 2 is 30% and Paper 3 is 40%, together 70%.

Is K130 offered to any private candidate?

The SEAB G1 school-candidate listing restricts the MOE–ITE applied subjects to approved schools.

Will K130 continue as the same examination in 2028?

SEAB says 2027 is the final examination year for these MOE–ITE applied subjects; no unannounced continuation should be assumed.

What proves that learning has transferred?

The learner can interpret a new problem, apply a relevant rule, show the necessary steps, describe the limitations and notice a familiar mistake without copying the previous worked answer.

Official sources and useful reading

The larger value: Digital logic is not merely electronic notation. It is a way to make conditions explicit, check every case and explain exactly why a system should or should not act.

eduKate Singapore parent–student consultation · Contact eduKateSG

Fact-checked against the published 2027 K130/K131 syllabus and SEAB listing on 5 November 2026. Examination requirements, eligibility and safe practical conditions remain subject to official and school instructions. Illustrations are educational, not instructions for real wiring or robot construction.

How G1 Mobile Robotics Logic Gates and Truth Tables Work | SEC Guide