Start with the decision, not the arithmetic
A school has twenty-four laptops and a charging trolley with a limited number of usable bays. Some computers are needed for an afternoon assessment. Others may be charged earlier. The immediate question is not “What is a watt?” but “Can every required device receive an allocated charging slot before it is needed, while all stated restrictions are respected?” This is a mathematical scheduling problem. Physics supplies useful vocabulary, but the main skills are tables, rates, inequalities, integer decisions and a clear final judgement.
A good G3 Mathematics student separates three different constraints: the number of devices that may occupy bays at the same moment, the duration that each device must occupy its bay, and the total time available before the deadline. The constraints may interact, but they are not interchangeable. The total available bay-hours could look adequate while a late group still has no feasible slot. A schedule might satisfy every individual duration but exceed the number of bays during an overlap.
This guide builds the model from simple counting to a real-world Paper 2 decision, with original examples and fully explained checks. It follows the Physics charging-trolley guide, Volume 1109, which distinguishes power ratings from actual energy. Here we assume any stated power and duration to be data given for a mathematics exercise.
The quick method: five boxes to fill
Write five boxes on your working page before attempting a multi-step schedule. Box one: available resources, such as six bays. Box two: tasks, such as ten laptops requiring one complete 45-minute slot. Box three: time windows, including arrival, earliest start and final completion. Box four: restrictions, such as a group that must remain together or two groups that cannot occupy the same bays. Box five: the requested decision and unit, such as minimum charging sessions, finishing time or a yes/no feasibility judgement.
A table should then show, for each interval, which devices occupy how many bays. A good table makes two checks possible: the row total does not exceed the bay limit, and each device receives the required number of minutes. Never assume a total of 18 bay-hours guarantees every deadline is met. If all 18 bay-hours occur before one group arrives, those hours are not available to that group.
Where a question imposes whole-number decisions, say so. You cannot assign 3.6 physical laptops. A calculated lower bound of 3.6 loads means at least four whole loads are required, provided the remaining restrictions permit four. Rounding is part of the model, not a decorative final adjustment.
What the official 2027 Mathematics paper requires
SEAB’s 2027 G3 school-candidate list identifies Mathematics as K310, with 4052 shown as the earlier code. The K310 syllabus gives Paper 1 a duration of two hours 15 minutes, 90 marks and a 50% weighting. Paper 2 has the same duration, marks and weighting; its final question focuses specifically on applying mathematics to a real-world scenario. The syllabus recognises personal and household finance and other everyday contexts and permits integration of topics in that extended problem.
The written working matters. The official notes state that essential working cannot be omitted without risking marks. An approved calculator may be used on both papers. Unless a question gives a different instruction, non-exact numerical results should generally be to three significant figures, and angles in degrees to one decimal place. But a count of laptops is a whole-number decision, and money may require currency-appropriate rounding. Mathematical convention must be reconciled with the requested answer.
This article is practice for interpreting, modelling, solving and communicating a conclusion, not a claim that a charging-trolley question will appear in the actual examination.
From PSLE counting to secondary variables
In primary mathematics, you may have solved a word problem by counting groups or drawing bars. At secondary level, you can retain that intuition while writing it formally. Let x be the number of completed batches. If one batch can contain no more than six devices, and there are twenty-four devices, then 6x ≥ 24, so x ≥ 4. As x counts batches, the minimum is four.
Notice what the inequality assumes: every device can use a suitable bay, all batches require the same duration, and there is no arrival constraint. Once a problem adds different arrival times, incompatible devices or compulsory groupings, the simple expression remains a useful lower bound but may not describe a workable timetable. This is a subtle improvement in reasoning. We move from an answer to a statement of the conditions under which it is true.
Students transitioning from PSLE can revisit the PSLE word-problem guide for identifying quantities and relationships. The new step is to write the governing restrictions transparently instead of hiding them in a mental picture.
Define quantities before building equations
Give every symbol a single meaning. For example, B = number of available charging bays; N = number of devices; d = minutes required per device; T = usable minutes before the deadline; x = number of whole batches. If power is introduced, use p in watts for the modelled power per occupied bay and E in Wh for energy. That helps avoid confusing a power rating with a slot count.
Write the units beside the symbols. A common mistake is to divide 180 minutes by 0.75 hours without converting one side. Another is to multiply a number of bays by the number of devices and call the result “capacity”. Capacity is not a single universal quantity. There is simultaneous capacity in devices, total occupancy in bay-minutes and a maximum energy budget in Wh if the problem supplies one.
Good notation becomes especially useful when the numbers change midway through the problem. If the usable time window shortens from 180 to 150 minutes, change T only. The other quantities retain their meaning. This makes your working auditable and easier to correct.
The first lower bound: bay-minutes
Suppose nine devices each require forty minutes and the trolley has three bays. The total required occupancy is 9 × 40 = 360 bay-minutes. Over a 120-minute window, three bays provide at most 3 × 120 = 360 bay-minutes. The two totals are equal. Does that prove the schedule is feasible? Not by itself. It shows the best-case resource budget is exactly sufficient. The schedule must use every bay continuously with no changes or delays, and the tasks must fit the available start times.
If all nine devices are present at the beginning and any can occupy any bay, three complete batches of forty minutes work. If three devices only arrive after ninety minutes, however, there are just thirty minutes left. They cannot complete forty-minute uninterrupted slots. The bay-minute total remains unchanged, yet the schedule is impossible. That is why a necessary condition is not always a sufficient condition.
In an exam, writing “the total is enough” may earn a calculation mark but lose the final decision mark if the arrival constraint is ignored. Use the lower bound, then construct or disprove a feasible allocation.
Simultaneous loads versus total work
A classroom has four bays. Two laptops operate from 09:00 to 09:45, and three more are scheduled from 09:30 to 10:15. Between 09:30 and 09:45, five devices would occupy bays simultaneously. The sum of their durations is five times forty-five minutes, which may seem small relative to the available bay-hours over the morning. Yet the proposed schedule violates the four-bay limit for fifteen minutes.
Draw a number-line timetable or interval table. On 09:00–09:30 there are two active devices; on 09:30–09:45 there are five; on 09:45–10:15 there are three. The maximum is five, so the schedule is infeasible. Repairing it means adjusting a start time, reallocating a group or adding capacity if the question permits that change. It does not mean subtracting fifteen from the total energy and assuming safety is restored.
This teaches an important general principle: aggregate totals and peak constraints answer different questions. They appear in school timetables, delivery loading bays, queues, classrooms and transport planning, not only electricity contexts.
Whole-number decisions: ceiling is necessary but not sufficient
If a batch of at most six computers can be charged for forty-five minutes, then sixteen computers require at least ceil(16/6) = 3 batches, where ceil means round up to the next whole number. In a no-friction model with unlimited preparation time, the duration is at least 3 × 45 = 135 minutes. If there are only 120 minutes, the task cannot be completed with strictly sequential forty-five-minute batches.
But a ratio may be misleading if the trolley offers different bay types or devices need different durations. For instance, eight laptops each needing thirty minutes and eight tablets each needing fifteen minutes may occupy the same bays at different rates. We can still use bay-minutes as a capacity test, but the optimal schedule may mix device types and start times rather than use uniform whole batches.
Always finish with the exact physical meaning of your rounding. If a calculation yields 2.4 trolley sessions, the answer cannot be 2.4 sessions. If the problem asks “Can all devices be ready by 15:00?”, a rounded count without checking the clock is incomplete.
Rate models: when energy enters the problem
Suppose the question gives an assumed constant input power of 40 W per occupied bay. If six bays are occupied for half an hour, modelled energy is 6 × 40 × 0.5 = 120 Wh. If only four bays are occupied for the next quarter-hour, the extra energy is 4 × 40 × 0.25 = 40 Wh. Total is 160 Wh. Dividing by 1000 gives 0.160 kWh.
The number 40 W is not inferred from the physical trolley. It is an assumption supplied in this mathematics exercise. That is important because the exact power drawn by a charger may vary. For the mathematical model, treating each occupied bay as a constant demand is acceptable only when the task says so.
A stronger question could provide a total modelled energy limit. Then two independent restrictions apply: no more than six simultaneous occupants, and no more than the specified total energy across the day. The first restricts each time slice; the second restricts the sum of all slices. Show both checks explicitly.
A table is a proof, not just a presentation choice
Consider a schedule with five bays and three intervals. From 08:00 to 08:30, four bays are occupied. From 08:30 to 09:15, five are occupied. From 09:15 to 09:45, two are occupied. The total occupancy is 4 × 30 + 5 × 45 + 2 × 30 = 405 bay-minutes. The window has a theoretical capacity of 5 × 105 = 525 bay-minutes. The unused capacity is 120 bay-minutes.
A table establishes the calculation at a glance. However, this occupancy summary does not show whether every named laptop got its full required interval. It is a capacity ledger, not a complete assignment ledger. To prove a feasible schedule you might add labels such as A–E for the devices and record their start and end times.
A useful distinction for exams is that a necessary numerical test is not a constructive demonstration. If a question asks you to propose a timetable, supply the allocation rather than only comparing totals. If it merely asks for the maximum available bay-minutes, the simpler table may be sufficient.
Intervals crossing a deadline
Suppose a group arrives at 13:40, each laptop requires a continuous fifty-minute charging slot and must be ready for a 14:30 lesson. The available interval is exactly fifty minutes, so starting immediately is possible in the idealised timetable. Starting at 13:45 is not, because only forty-five minutes remain. The fact that five minutes seem small does not make the shortfall negligible.
A student may accidentally count 13:40–14:30 as ninety minutes by subtracting clock digits incorrectly. Use the twenty-four-hour clock or minutes after noon: 13:40 becomes 100 minutes after 12:00, and 14:30 becomes 150. Difference = 50 minutes. When the time interval crosses an hour boundary, always check using a number line.
The exam may combine different classes with different deadlines. In that case an earliest-deadline-first approach is often useful as a candidate schedule, but it is not a universal theorem for arbitrary task constraints. Construct the schedule and test it instead of naming a rule as if it proved feasibility.
Modelling compulsory groupings
Imagine six bays and twelve devices. Four devices belong to a testing set that must begin and finish charging together; the remaining eight can be split. Each device needs thirty minutes. If all are available at 09:00, the four-device group can occupy four bays from 09:00 to 09:30, with two other devices using the spare bays. The six remaining devices can occupy all bays from 09:30 to 10:00. This completes all twelve in one hour.
The total occupancy is 12 × 30 = 360 bay-minutes, exactly equal to six bays for sixty minutes. In this case a constructive schedule meets the lower bound. If the compulsory four-device group arrived at 09:20, the earlier arrangement would need revision, and completion by 10:00 might be impossible despite the same total required occupancy.
Group constraints turn simple arithmetic into an allocation problem. The right first move is to identify which tasks cannot be divided, then fit other tasks around them. It is better to show one valid timetable than to make an unsupported claim that “the average capacity is enough”.
Modelling two types of bays
Suppose a school exercise gives four standard bays and two specialised bays. Eight devices can use either type, but three devices can use only the specialised bays. Each task requires one uninterrupted thirty-minute slot. The specialised-only devices need ninety specialised bay-minutes in total; two specialised bays over one hour offer 120. Thus the specialised pool may be sufficient for those three, provided arrival times permit.
A poor strategy fills both specialised bays with flexible devices at the beginning and later discovers the restricted devices cannot finish. A better strategy reserves scarce resources for tasks that have no alternative, using standard bays for flexible tasks where possible. This is a qualitative insight supported by an explicit table.
When the question asks for a maximum number of completed devices, the answer may depend on resource compatibility, not merely on the total of six bays. Distinguish different capacities in your symbols: S = four standard bays, R = two restricted bays. Constraints should express their permitted uses.
Testing a proposed schedule rather than finding one
Many exam tasks give a timetable and ask whether it is valid. That is easier than constructing the best one, but it still requires a systematic audit. Inspect every interval boundary: when a task starts, when another ends and when a deadline occurs. Peak occupancy can change only at those events in a model with fixed start and end times. You do not need to examine every second.
For each interval, count occupied bays. Then check individual durations and deadlines. If a suggested schedule uses six bays in the first interval, five in the second and seven in the third while the capacity is six, you can reject it on the third interval without calculating the total energy. If all interval counts pass but one laptop receives twenty-five minutes instead of the required thirty, it still fails.
Present the failed condition precisely: “From 10:15 to 10:25 seven bays would be occupied, exceeding six by one.” Such a statement is stronger than “the timetable is wrong” because it identifies the repairable location of the error.
Algebraic inequality: reserve bays for late arrivals
A trolley has eight bays. Five are permanently assigned during the first sixty minutes. The remaining bays can be used for a late-arriving group of x computers. The simultaneous constraint is 5 + x ≤ 8, so x ≤ 3. If the late group contains four computers and cannot be split, the proposal fails. If splitting is allowed, three can start immediately and one must wait until a bay is freed.
A later condition might allow only twenty minutes for the waiting computer, even though it needs thirty. Then the overall plan remains infeasible. The first inequality describes capacity, not timing. An inequality is a model of one requirement; it is not a magic replacement for all other requirements.
In written working, explain what x counts. State x is a non-negative whole number. Without an integer restriction, “x ≤ 3” is mathematically correct but leaves open fractional values that have no real interpretation in this problem. Good models join algebra and context.
Reverse design: minimum required bays
Suppose eighteen computers must each receive a continuous forty-minute slot, all are available at 08:00 and all must finish by 10:00. Assume no changeover time. In two hours, one bay can accommodate three forty-minute slots. Therefore at least 18/3 = 6 bays are required. Six bays suffice: six devices 08:00–08:40, six 08:40–09:20 and six 09:20–10:00.
If the required duration were forty-five minutes, one bay could complete at most two whole slots within 120 minutes, leaving thirty minutes unused. At least nine bays would be needed for eighteen devices, not ceil(18 × 45 / 120) = ceil(6.75) = 7. The bay-minute lower bound underestimates the necessary number because non-preemptive forty-five-minute tasks do not fit three times in a 120-minute window.
This is an important examination insight: resource-hours are useful, but the indivisibility of tasks changes what is possible. Explain why you rounded or used floor/ceiling in context.
One correct graph and one misleading graph
Suppose a plot shows occupied bays against time. The height at a given moment is the simultaneous number of devices, and the area under each constant segment, in bay-minutes, represents cumulative occupancy. A peak above the capacity line means the schedule violates the limit even if the total shaded area is modest. A graph of accumulated energy, by contrast, rises over time under positive demand; its final height gives total energy, not peak power.
Students sometimes look only at an endpoint and miss the shape. On a cumulative graph, two plans can end at the same total but have very different steepness during busy intervals. On an occupancy graph, the maximum height is central to capacity. Always read the axis titles before making a claim. A graph without units may conceal whether its values are watts, Wh or counts.
A robust answer links one feature of the graph to one real-world interpretation: “The count reaches seven during the overlap, so a six-bay model cannot support this schedule.”
Percentages and budget claims
A proposed new timetable reduces modelled daily energy from 2.4 kWh to 2.1 kWh. The reduction is 0.3 kWh and the percentage reduction relative to the original is (0.3/2.4) × 100 = 12.5%. If someone writes “energy efficiency improved by 12.5%”, that may go beyond the data; the numbers show a reduction in modelled energy consumption, not necessarily a change in physical conversion efficiency.
Another proposal moves charging to a different period but retains the same number of device-hours and assumed constant power per device. Under that model it may leave energy unchanged, even if it reduces maximum simultaneous demand. A lower peak is not automatically a lower total energy figure. Specify which outcome is being optimised.
In G3 Mathematics, a percentage can be correctly calculated and still poorly interpreted. Always name the reference total: percentage of what? Then say whether the result is an estimate, a model or a measured change, according to the information provided.
Worked case: a failed eight-bay plan
A trolley has eight bays. Twelve laptops need one forty-minute slot each. Six arrive at 09:00 and six arrive at 09:30. All must be ready by 10:20. A suggested plan starts the first eight computers at 09:00. This is impossible because only six are present. Another plan starts six at 09:00, then all six late arrivals at 09:30. That overlaps six earlier chargers for ten minutes, requiring twelve bays. Also impossible.
A workable plan? First six occupy bays 09:00–09:40. The remaining six start at 09:40 and finish at 10:20. Every task has forty minutes, at most six of eight bays are used, and all deadlines are met. A student who focuses only on the total occupancy might miss both rejected suggestions. The constructive allocation demonstrates feasibility.
The answer should not merely assert that the eight-bay trolley has enough room. It should display the actual times and the maximum simultaneous count.
Worked case: the late group makes the task impossible
Use the previous arrangement but change the late arrival from 09:30 to 09:50, leaving a deadline of 10:20. The six late devices now have only thirty minutes before the deadline and each needs a continuous forty-minute slot. No number of additional bays can create the missing ten minutes under the specified arrival and deadline conditions. The schedule is impossible.
This is a useful counterexample to a common instinct: if a plan fails, add more capacity. Here the binding constraint is time, not bay count. The correct final answer identifies the limiting condition and refuses to recommend an irrelevant change.
In your working, write 10:20 − 09:50 = 30 minutes and compare it with the required 40 minutes. Since 30 < 40, none of the newly arrived devices can complete their stipulated uninterrupted slot by 10:20. The proof is short precisely because you selected the decisive restriction.
Worked case: reduce peak without changing energy
A hypothetical timetable has four 50 W loads running from 14:00 to 14:30 and another four 50 W loads from 14:15 to 14:45. From 14:15 to 14:30, eight loads run together, giving an assumed instantaneous modelled power of 8 × 50 = 400 W. Every load runs for half an hour, so total energy is 8 × 50 × 0.5 = 200 Wh.
Now move the second group to 14:30–15:00. The maximum power becomes 4 × 50 = 200 W, while total energy remains 200 Wh. The model’s peak has halved but the energy is unchanged. This is not a prediction of actual chargers; it is a consequence of the stipulated constant-power model.
If a school question asks whether the rescheduling saves electricity, the correct answer is no under these assumptions. It changes the time distribution. If it asks whether the modelled peak has been lowered, the answer is yes. Learn to keep the two conclusions separate.
Worked case: a paper-two-style extended problem
A school has six bays from 12:00 to 14:00. Group A contains six devices needing thirty minutes each, available at noon and needed by 13:00. Group B contains four devices needing forty-five minutes each, available from 12:45 and needed by 14:00. Group C contains two devices needing thirty minutes each, available from 13:15 and needed by 14:00. All tasks are non-preemptive. Find one feasible timetable.
One answer: A occupies six bays 12:00–12:30. B occupies four bays 12:45–13:30. C occupies two bays 13:15–13:45. During 13:15–13:30, four plus two = six bays, exactly at capacity. Every group starts no earlier than its arrival and finishes by its deadline. Unused time between 12:30 and 12:45 is not a problem.
If the question imposes an additional rule that Group C must begin by 13:10, this plan is impossible because C arrives at 13:15. The changed condition overrides the earlier correct solution. Read late-added qualifications as carefully as the main numbers.
Worked case: modelled energy by time slice
Use the previous timetable and assume each occupied bay consumes 35 W at constant input for the stated interval. A contributes 6 × 35 × 0.5 = 105 Wh. B contributes 4 × 35 × 0.75 = 105 Wh. C contributes 2 × 35 × 0.5 = 35 Wh. Total = 245 Wh = 0.245 kWh. This sum is independent of the overlap because each device’s operating duration is counted once.
Check by time slices: noon–12:30 has six loads for half an hour (105 Wh); 12:45–13:15 has four for half an hour (70 Wh); 13:15–13:30 has six for quarter of an hour (52.5 Wh); 13:30–13:45 has two for quarter of an hour (17.5 Wh). Sum = 245 Wh again. Two representations agree.
If your two totals disagree, inspect for double-counting during overlaps, missed intervals or conversion errors. A timetable is not an excuse to abandon unit discipline.
Worked case: minimum number of bays under exact deadlines
Four devices need a full sixty minutes before 12:00, and another four devices need a full sixty minutes before 12:30. All are available at 10:30 and each occupies one bay continuously. With four bays, charge the first group 10:30–11:30 and the second 11:30–12:30. The deadlines are satisfied, so four bays suffice.
Could three bays work? The eight device-hours? Each device requires one hour, giving eight bay-hours. Only two hours are available from 10:30 to 12:30, so three bays yield six bay-hours. This is a necessary-condition failure, proving three cannot suffice. Four is therefore the minimum.
The argument has two parts: lower-bound proof (fewer cannot work) and constructive proof (four can work). Giving only the timetable proves feasibility, but not minimum capacity; giving only the lower bound does not always prove feasibility. Together they form a complete mathematical justification.
Where most candidates lose marks
Common failures include treating a total occupancy figure as proof of a feasible deadline schedule; rounding down a count of batches; failing to distinguish a whole number from a continuous variable; using kWh as if it were instantaneous power; overlooking a fifteen-minute overlap; misreading a 24-hour clock; assuming a charger’s maximum rating is its actual energy use; or presenting a number without answering the yes/no question.
For each failure, make an operational correction. Draw interval boundaries; state the integer condition; carry units through each step; attach a source or stated assumption to every figure; finish with an explicit sentence comparing the result against the limit. An error ledger should record the first incorrect reasoning step, not simply that the final answer was wrong.
Consider retesting with altered numbers. If you solved six bays over 120 minutes, replace the windows with 95 minutes and add a late arrival. Can you still identify the decisive restriction? Transfer to a changed situation is stronger evidence of understanding than repetition of a memorised timetable.
Paper 1 versus Paper 2 strategy
Paper 1 typically rewards concise, correct techniques. A straightforward task may ask for percentage change, a rate, a linear inequality or conversion of minutes to hours. Use a compact layout: variable definition, relationship, substitution, answer with a suitable unit. A calculator should support, not replace, reasoning.
Paper 2 has space for connected work. In an extended real-world problem, the most efficient route is to identify the decision, arrange the relevant data, build constraints, find a candidate allocation and verify every condition. Do not spend many minutes optimising a fancy timetable if the question merely asks for one valid schedule. Conversely, if it asks for the minimum number of bays, one valid example is not enough: show why fewer cannot work.
Exam time is limited, so annotate the condition that changes the answer. A final line such as “not feasible because Group B arrives after the latest possible start time” is often more valuable than a page of unrelated calculations.
A five-day practice plan
Day 1: build tables for two sequential batches. Day 2: draw overlapping timelines and mark peak occupancy. Day 3: solve integer inequalities and reverse-capacity questions. Day 4: combine arrivals, deadlines, group restrictions and optional energy calculations. Day 5: complete a timed Paper 2-style scenario and write a decision paragraph. For every mistake, specify whether the model omitted a condition or the arithmetic failed.
The best next question is not always harder numerically. Sometimes a tiny change in arrival time defeats a previously valid solution. Learn to notice what the condition does. Try explaining your answer aloud without the calculator: “Six bays are enough because the proposed timeline never exceeds six occupants, each group gets its required minutes, and every deadline is met.” If you cannot say that, the proof may be incomplete.
For wider study, use the Secondary 4 Mathematics real-world Paper 2 owner to place these ideas within general modelling, constraints, checking and communication.
Frequently asked questions
Is this an official SEC sample question? No. It is an original worked scenario designed around the current K310 syllabus skills.
What if the number of devices divided by the number of bays is not whole? For identical batches, round up the number of whole batches, then verify timing and compatibility.
Does enough total bay-time prove the timetable works? Not necessarily. Arrivals, deadlines and uninterrupted slots can make a schedule impossible.
Do I need Physics to answer? Only enough context to interpret the given data. Mathematics governs the model once the assumptions and units are stated.
Can a lower peak reduce the bill? Not by itself under a constant-power, fixed-duration model. Peak demand and accumulated energy are different.
Why show a second solution route? Independent checking can reveal double-counting and makes a conclusion more reliable.
How should I round money? Follow the question’s currency instruction and present meaningful cents if appropriate, while preserving sufficient precision in intermediate work.
Can a calculator replace a timetable? No. The calculation may verify totals, but the allocation must meet each constraint.
What comes next? Volume 1111 trains English listening comprehension using a changing charging-trolley briefing, especially revised instructions, speakers’ conditions and accurate notes.
Continue learning without repeating a topic
Review Volume 1109 for Physics input/output power and energy; Volume 1106 for circuit-design inequalities; and the wider SEC Mathematics real-world problem guide for a general approach. Students bridging from PSLE can start with the Secondary 1 G3 transition route.
Verify the authoritative 2027 exam description using SEAB’s G3 catalogue and K310 Mathematics syllabus. The event times, bay numbers and charging powers in these exercises are invented mathematical data; they are not operating advice for real school electrical equipment. Actual equipment and safety decisions belong to trained personnel.
