Sec 3 G3 Maths Bukit Timah | Transport Timetables

Secondary 3 G3 Mathematics Tutor Bukit Timah | Transport Timetables: Journey Times, Connections and Arrival Planning — Did you know? The fastest vehicle is not always the route that arrives first. A ten-minute wait for a connection can erase the saving from a faster ride. In SEC G3 Mathematics, transport and excursion stories test whether students can turn times, rates and constraints into a coherent model rather than merely adding numbers. Here is the quick method, then forty independently checkable examples.

Quick answer: solve timetable questions in seven steps

Write times in one notation: 08:45, 09:12 and 13:05 are 24-hour clock times, not decimal hours.
Construct a timeline: departure → ride → arrival at interchange → wait → next ride → final walk → destination.
Elapsed duration: arrival time minus departure time, adjusting for midnight where necessary.
Travel buffer: include stated walking, security, ticketing or connection time only when the question specifies it.
Latest safe departure: target arrival time minus all required durations, including the requested buffer.
Service intervals: if departures occur every n minutes from a specified start, list or calculate valid departure times rather than guessing.
Multiple route choices: compare total end-to-end time, cost and constraints—vehicle speed alone is insufficient.
Average speed: total distance divided by total elapsed time, using compatible units and any wait time the question says to include.
Check the meaning: ‘earliest arrival’, ‘cheapest route’, and ‘fewest transfers’ are different objectives.

This Secondary 3 G3 Mathematics tutor Bukit Timah guide connects to the 2027 SEC G3 Mathematics K310 syllabus, which expressly identifies travel and excursion plans and transport schedules among possible real-world contexts. The mathematical tools include rates and speeds, ratios, graphs, equations and problem interpretation. All departure times, fares and route descriptions below are hypothetical teaching data, not live Singapore public-transport schedules.

Find your section: Understand the timeline · 40 worked examples · Common mistakes · Six-week study plan · FAQs.

How to think through travel and arrival-time questions

Clock time and elapsed time are not the same quantity

A departure at 08:15 is a point on the clock. A ride lasting 35 minutes is a duration. Adding the duration gives arrival at 08:50, but the number 08:15 should never be treated as the decimal 8.15 hours. The minutes after the colon range from 00 through 59.

When time arithmetic becomes complicated, convert a clock reading to minutes after midnight. For 08:15, calculate 8×60+15=495 minutes. Add or subtract durations in minutes, then convert the result back to a clock time. This gives a reproducible method rather than finger-counting on a clock face.

A route is a series of events, not one vehicle ride

A route may include a seven-minute walk, a fourteen-minute train ride, an eight-minute wait and a twenty-minute bus ride. The complete journey duration is 7+14+8+20=49 minutes. If the question asks for end-to-end travel time, omitting the walk and wait would understate the answer.

Draw a single line with each transition labelled. Writing the events in order helps distinguish a travel duration from the clock time when the event happens. A clear model is more valuable than attempting to remember four disconnected numbers.

A connection can make a faster vehicle arrive later

Suppose Route A involves a 25-minute bus ride with no transfer, while Route B involves a twelve-minute train ride, a ten-minute wait and a nine-minute walk. Route B totals 31 minutes and therefore arrives six minutes later if both routes start together. The faster vehicle ride is not the faster entire route.

The comparison requires the same starting point, departure clock time and endpoint. Students who select the twelve-minute figure alone have compared only vehicle segments. The result should describe the complete route.

Latest departure questions are inverse problems

If an activity starts at 10:30 and the specified trip takes 45 minutes with a ten-minute arrival buffer, the latest safe starting time is 10:30−55 minutes=09:35. It is easier to work backwards from the fixed requirement than to test many possible departure times.

Once the departure is found, check by moving forwards again. Start at 09:35, travel 45 minutes to 10:20 and preserve the ten-minute buffer. This reverse check demonstrates that the answer meets both the travel constraint and the punctuality requirement.

Frequency questions need an origin and interval

If a hypothetical service departs every twelve minutes starting at 08:00, departures include 08:00, 08:12, 08:24 and so on. The question cannot be solved from ‘every twelve minutes’ alone without an initial departure or other reference point.

To determine the next service after 08:19, list the nearby departures or calculate multiples of twelve from 08:00. The next is 08:24, with a five-minute wait. This uses a discrete timetable, not average speed.

Travel across midnight needs a day label

A bus leaving at 23:45 and arriving at 00:20 the next day took 35 minutes, not a negative number of minutes. Use the first day’s 23:45 as 1425 minutes and the next day’s 00:20 as 1440+20=1460 minutes. The difference is 35.

School questions using overnight schedules often state ‘the next day’. Retain that information when converting back into 24-hour clock notation. An answer of 00:20 without saying next day may omit a meaningful part of the journey.

The number of stops does not by itself determine the duration

One route may have six stops close together and another three stops spaced far apart. To compute a timetable answer, use departure, arrival, waiting and walking information supplied by the question, rather than assuming a fixed number of minutes per stop.

A mathematical model should not import an unstated rule about how long every bus stop, train stop or traffic light takes. If a problem explicitly states ‘three minutes per stop’, then multiplication is appropriate; without that assumption, the stop count alone is insufficient.

Budget constraints can change the best route

A trip might have a bus option costing $3 and taking 45 minutes, and a train option costing $5 and taking 30 minutes. The train is faster, but a $4 transport budget rules it out. The ‘best’ answer depends on which constraints are compulsory and which preference the problem asks you to optimise.

Students can create a small table with columns for price, duration, transfers and feasibility. A complete answer then explains why the selected route satisfies every condition. One lowest number alone may not answer a multi-constraint question.

Average speed and timetable duration ask different questions

If two stages cover 30 km in one hour and 40 km in two hours, the overall average speed is total distance 70 km divided by total time three hours, approximately 23.3 km/h. It is not generally the simple average of stage speeds.

A timetable question may include stop time in the total elapsed journey. Whether that waiting belongs in the average-speed denominator depends on the precise wording. The general mathematical habit is to specify which period and distance are being compared.

Sensible checks catch time-order mistakes

An arrival cannot precede departure on the same day if the stated journey duration is positive. A connection cannot be boarded before the first stage reaches the interchange. A latest-start calculation must be checked against the final deadline and stated buffer.

These checks do not require a calculator. A timeline with event ordering gives an independent way to catch an impossible result and explain the correction.

Different representations can solve the same schedule

A table can show departure and arrival options; a number line can show elapsed durations; a simple equation can recover an unknown departure; and a graph can show distance against time. These are different views of the same story, each useful for a different requested quantity.

A good tutor asks the student which representation makes the constraint easiest to see. Selecting the model is an assessed problem-solving skill under the K310 framework, alongside the arithmetic.

Use hypothetical timetables responsibly

Real-world services experience disruptions, special-day schedules and operational changes. This article deliberately uses invented numbers to practise Mathematics without misrepresenting a current bus or MRT timetable. Real journeys need current official route and schedule information.

The pupil’s task is to solve the assumed mathematical situation as written. It is also worth recognising the boundary between an exam model and the real conditions of a journey. Knowing what was assumed is part of reliable mathematical interpretation.

40 worked examples with timeline checks

The following are original educational examples, not real bus, rail or flight listings and not official examination questions. Ten families appear in four numerical variations each. Try a short set without viewing the method, name the requested clock time or duration, and check the events in forward order. The small scenarios are deliberately focused so that one mathematical decision can be practised at a time.

Add a trip duration to a departure

This group focuses on add a trip duration to a departure. Decide whether to add durations, subtract backwards from a deadline, or enforce a schedule or budget. The same number can represent a clock time or a duration, so label each carefully.

Worked example 1. Question: A hypothetical shuttle leaves at 08:15 and rides for 30 minutes. When does it arrive? Method: Departure is 495 minutes after midnight. Add 30 minutes to get 525, which is 08:45. Check: The difference 08:45 minus 08:15 is exactly 30 minutes. Watch for: Clock notation 08:15 is not a decimal number; add minutes, not a hundredths fraction.

Independent extension: Convert the departure to minutes after midnight, add the duration and then convert back to a clock reading. Draw a two-column table of clock times and elapsed minutes and confirm they are consistent. Change one duration or deadline, then predict how the arrival or departure should change before recalculating. Comparing an original attempt with a later independent variant is a stronger retention check than copying the finished timeline.

Worked example 2. Question: A hypothetical shuttle leaves at 08:20 and rides for 37 minutes. When does it arrive? Method: Departure is 500 minutes after midnight. Add 37 minutes to get 537, which is 08:57. Check: The difference 08:57 minus 08:20 is exactly 37 minutes. Watch for: Clock notation 08:20 is not a decimal number; add minutes, not a hundredths fraction.

Independent extension: Make a labelled timeline so a waiting period cannot disappear between two ride segments. Increase one waiting period by five minutes and predict which end time changes. Change one duration or deadline, then predict how the arrival or departure should change before recalculating. Comparing an original attempt with a later independent variant is a stronger retention check than copying the finished timeline.

Worked example 3. Question: A hypothetical shuttle leaves at 08:25 and rides for 44 minutes. When does it arrive? Method: Departure is 505 minutes after midnight. Add 44 minutes to get 549, which is 09:09. Check: The difference 09:09 minus 08:25 is exactly 44 minutes. Watch for: Clock notation 08:25 is not a decimal number; add minutes, not a hundredths fraction.

Independent extension: State whether your answer is a clock time, a number of minutes or a cost; each has a different unit. Find the earliest and latest feasible arrival in the stated scenario, if the information permits. Change one duration or deadline, then predict how the arrival or departure should change before recalculating. Comparing an original attempt with a later independent variant is a stronger retention check than copying the finished timeline.

Worked example 4. Question: A hypothetical shuttle leaves at 08:30 and rides for 51 minutes. When does it arrive? Method: Departure is 510 minutes after midnight. Add 51 minutes to get 561, which is 09:21. Check: The difference 09:21 minus 08:30 is exactly 51 minutes. Watch for: Clock notation 08:30 is not a decimal number; add minutes, not a hundredths fraction.

Independent extension: Before comparing routes, include all the stages requested and apply any affordability or deadline restriction. Compare the result with a competing route that has fewer transfers but a longer ride. Change one duration or deadline, then predict how the arrival or departure should change before recalculating. Comparing an original attempt with a later independent variant is a stronger retention check than copying the finished timeline.

Add walk, ride and connection wait

This group focuses on add walk, ride and connection wait. Decide whether to add durations, subtract backwards from a deadline, or enforce a schedule or budget. The same number can represent a clock time or a duration, so label each carefully.

Worked example 5. Question: Starting at 09:10, a pupil walks 7 minutes, rides 20 minutes and then waits 4 minutes at the interchange. What clock time is reached? Method: Total duration=7+20+4=31 minutes. The resulting clock time is 09:41. Check: Subtracting the start time from 09:41 gives the same 31-minute elapsed duration. Watch for: A wait is time spent on the journey even though no distance is covered during it.

Independent extension: Check by reversing the operation: a latest-departure result must reach the activity early enough. Explain which unstated information would be needed to use this model for a real Singapore journey. Change one duration or deadline, then predict how the arrival or departure should change before recalculating. Comparing an original attempt with a later independent variant is a stronger retention check than copying the finished timeline.

Worked example 6. Question: Starting at 09:13, a pupil walks 8 minutes, rides 23 minutes and then waits 6 minutes at the interchange. What clock time is reached? Method: Total duration=8+23+6=37 minutes. The resulting clock time is 09:50. Check: Subtracting the start time from 09:50 gives the same 37-minute elapsed duration. Watch for: A wait is time spent on the journey even though no distance is covered during it.

Independent extension: Distinguish the next scheduled departure from the time interval between services. Use the final answer to recreate the original schedule information as a reverse check. Change one duration or deadline, then predict how the arrival or departure should change before recalculating. Comparing an original attempt with a later independent variant is a stronger retention check than copying the finished timeline.

Worked example 7. Question: Starting at 09:16, a pupil walks 9 minutes, rides 26 minutes and then waits 8 minutes at the interchange. What clock time is reached? Method: Total duration=9+26+8=43 minutes. The resulting clock time is 09:59. Check: Subtracting the start time from 09:59 gives the same 43-minute elapsed duration. Watch for: A wait is time spent on the journey even though no distance is covered during it.

Independent extension: Do not use decimal arithmetic on the minute portion of HH:MM notation. Draw a two-column table of clock times and elapsed minutes and confirm they are consistent. Change one duration or deadline, then predict how the arrival or departure should change before recalculating. Comparing an original attempt with a later independent variant is a stronger retention check than copying the finished timeline.

Worked example 8. Question: Starting at 09:19, a pupil walks 10 minutes, rides 29 minutes and then waits 10 minutes at the interchange. What clock time is reached? Method: Total duration=10+29+10=49 minutes. The resulting clock time is 10:08. Check: Subtracting the start time from 10:08 gives the same 49-minute elapsed duration. Watch for: A wait is time spent on the journey even though no distance is covered during it.

Independent extension: Check whether a midnight crossing needs a ‘next day’ label in the reported time. Increase one waiting period by five minutes and predict which end time changes. Change one duration or deadline, then predict how the arrival or departure should change before recalculating. Comparing an original attempt with a later independent variant is a stronger retention check than copying the finished timeline.

Work backwards from an arrival deadline

This group focuses on work backwards from an arrival deadline. Decide whether to add durations, subtract backwards from a deadline, or enforce a schedule or budget. The same number can represent a clock time or a duration, so label each carefully.

Worked example 9. Question: An event begins at 10:30. A trip takes 40 minutes and a pupil must arrive 10 minutes early. Find the latest starting time. Method: Work backwards: 10:30−50 minutes=09:40. Total required time before the event is 50 minutes. Check: Starting at 09:40 and travelling 40 minutes gives arrival 10:20, leaving the required buffer. Watch for: Subtract both travel duration and early-arrival buffer, not just the ride time.

Independent extension: List which conditions were supplied, and avoid inventing an unstated waiting time. Find the earliest and latest feasible arrival in the stated scenario, if the information permits. Change one duration or deadline, then predict how the arrival or departure should change before recalculating. Comparing an original attempt with a later independent variant is a stronger retention check than copying the finished timeline.

Worked example 10. Question: An event begins at 10:40. A trip takes 43 minutes and a pupil must arrive 11 minutes early. Find the latest starting time. Method: Work backwards: 10:40−54 minutes=09:46. Total required time before the event is 54 minutes. Check: Starting at 09:46 and travelling 43 minutes gives arrival 10:29, leaving the required buffer. Watch for: Subtract both travel duration and early-arrival buffer, not just the ride time.

Independent extension: Repeat the question after a delay with changed times and explain the first decision independently. Compare the result with a competing route that has fewer transfers but a longer ride. Change one duration or deadline, then predict how the arrival or departure should change before recalculating. Comparing an original attempt with a later independent variant is a stronger retention check than copying the finished timeline.

Worked example 11. Question: An event begins at 10:50. A trip takes 46 minutes and a pupil must arrive 12 minutes early. Find the latest starting time. Method: Work backwards: 10:50−58 minutes=09:52. Total required time before the event is 58 minutes. Check: Starting at 09:52 and travelling 46 minutes gives arrival 10:38, leaving the required buffer. Watch for: Subtract both travel duration and early-arrival buffer, not just the ride time.

Independent extension: Convert the departure to minutes after midnight, add the duration and then convert back to a clock reading. Explain which unstated information would be needed to use this model for a real Singapore journey. Change one duration or deadline, then predict how the arrival or departure should change before recalculating. Comparing an original attempt with a later independent variant is a stronger retention check than copying the finished timeline.

Worked example 12. Question: An event begins at 11:00. A trip takes 49 minutes and a pupil must arrive 13 minutes early. Find the latest starting time. Method: Work backwards: 11:00−62 minutes=09:58. Total required time before the event is 62 minutes. Check: Starting at 09:58 and travelling 49 minutes gives arrival 10:47, leaving the required buffer. Watch for: Subtract both travel duration and early-arrival buffer, not just the ride time.

Independent extension: Make a labelled timeline so a waiting period cannot disappear between two ride segments. Use the final answer to recreate the original schedule information as a reverse check. Change one duration or deadline, then predict how the arrival or departure should change before recalculating. Comparing an original attempt with a later independent variant is a stronger retention check than copying the finished timeline.

Find the next periodic departure

This group focuses on find the next periodic departure. Decide whether to add durations, subtract backwards from a deadline, or enforce a schedule or budget. The same number can represent a clock time or a duration, so label each carefully.

Worked example 13. Question: A hypothetical service leaves every 12 minutes from its first 08:00 departure. A passenger arrives at the stop at 08:16. What is the next departure and waiting time? Method: Scheduled departures are 08:00, 08:12, 08:24. The passenger misses the second, so the next is 08:24, after 8 minutes. Check: The next departure is a whole multiple of 12 minutes after the first, and it occurs after the passenger arrives. Watch for: A service interval without its starting time is insufficient to recover an absolute departure schedule.

Independent extension: State whether your answer is a clock time, a number of minutes or a cost; each has a different unit. Draw a two-column table of clock times and elapsed minutes and confirm they are consistent. Change one duration or deadline, then predict how the arrival or departure should change before recalculating. Comparing an original attempt with a later independent variant is a stronger retention check than copying the finished timeline.

Worked example 14. Question: A hypothetical service leaves every 15 minutes from its first 08:03 departure. A passenger arrives at the stop at 08:23. What is the next departure and waiting time? Method: Scheduled departures are 08:03, 08:18, 08:33. The passenger misses the second, so the next is 08:33, after 10 minutes. Check: The next departure is a whole multiple of 15 minutes after the first, and it occurs after the passenger arrives. Watch for: A service interval without its starting time is insufficient to recover an absolute departure schedule.

Independent extension: Before comparing routes, include all the stages requested and apply any affordability or deadline restriction. Increase one waiting period by five minutes and predict which end time changes. Change one duration or deadline, then predict how the arrival or departure should change before recalculating. Comparing an original attempt with a later independent variant is a stronger retention check than copying the finished timeline.

Worked example 15. Question: A hypothetical service leaves every 18 minutes from its first 08:06 departure. A passenger arrives at the stop at 08:30. What is the next departure and waiting time? Method: Scheduled departures are 08:06, 08:24, 08:42. The passenger misses the second, so the next is 08:42, after 12 minutes. Check: The next departure is a whole multiple of 18 minutes after the first, and it occurs after the passenger arrives. Watch for: A service interval without its starting time is insufficient to recover an absolute departure schedule.

Independent extension: Check by reversing the operation: a latest-departure result must reach the activity early enough. Find the earliest and latest feasible arrival in the stated scenario, if the information permits. Change one duration or deadline, then predict how the arrival or departure should change before recalculating. Comparing an original attempt with a later independent variant is a stronger retention check than copying the finished timeline.

Worked example 16. Question: A hypothetical service leaves every 21 minutes from its first 08:09 departure. A passenger arrives at the stop at 08:37. What is the next departure and waiting time? Method: Scheduled departures are 08:09, 08:30, 08:51. The passenger misses the second, so the next is 08:51, after 14 minutes. Check: The next departure is a whole multiple of 21 minutes after the first, and it occurs after the passenger arrives. Watch for: A service interval without its starting time is insufficient to recover an absolute departure schedule.

Independent extension: Distinguish the next scheduled departure from the time interval between services. Compare the result with a competing route that has fewer transfers but a longer ride. Change one duration or deadline, then predict how the arrival or departure should change before recalculating. Comparing an original attempt with a later independent variant is a stronger retention check than copying the finished timeline.

Cross midnight and keep the day change

This group focuses on cross midnight and keep the day change. Decide whether to add durations, subtract backwards from a deadline, or enforce a schedule or budget. The same number can represent a clock time or a duration, so label each carefully.

Worked example 17. Question: A fictional late service leaves at 23:30 and travels for 40 minutes. Give arrival clock time and day. Method: Starting minutes=1410; add 40 to get 1450, greater than 1440. Arrival is 00:10 on the next day. Check: Subtracting 1410 from 1450 gives 40 minutes, not a negative duration. Watch for: A 00:xx clock reading after a 23:xx departure needs a next-day label.

Independent extension: Do not use decimal arithmetic on the minute portion of HH:MM notation. Explain which unstated information would be needed to use this model for a real Singapore journey. Change one duration or deadline, then predict how the arrival or departure should change before recalculating. Comparing an original attempt with a later independent variant is a stronger retention check than copying the finished timeline.

Worked example 18. Question: A fictional late service leaves at 23:33 and travels for 45 minutes. Give arrival clock time and day. Method: Starting minutes=1413; add 45 to get 1458, greater than 1440. Arrival is 00:18 on the next day. Check: Subtracting 1413 from 1458 gives 45 minutes, not a negative duration. Watch for: A 00:xx clock reading after a 23:xx departure needs a next-day label.

Independent extension: Check whether a midnight crossing needs a ‘next day’ label in the reported time. Use the final answer to recreate the original schedule information as a reverse check. Change one duration or deadline, then predict how the arrival or departure should change before recalculating. Comparing an original attempt with a later independent variant is a stronger retention check than copying the finished timeline.

Worked example 19. Question: A fictional late service leaves at 23:36 and travels for 50 minutes. Give arrival clock time and day. Method: Starting minutes=1416; add 50 to get 1466, greater than 1440. Arrival is 00:26 on the next day. Check: Subtracting 1416 from 1466 gives 50 minutes, not a negative duration. Watch for: A 00:xx clock reading after a 23:xx departure needs a next-day label.

Independent extension: List which conditions were supplied, and avoid inventing an unstated waiting time. Draw a two-column table of clock times and elapsed minutes and confirm they are consistent. Change one duration or deadline, then predict how the arrival or departure should change before recalculating. Comparing an original attempt with a later independent variant is a stronger retention check than copying the finished timeline.

Worked example 20. Question: A fictional late service leaves at 23:39 and travels for 55 minutes. Give arrival clock time and day. Method: Starting minutes=1419; add 55 to get 1474, greater than 1440. Arrival is 00:34 on the next day. Check: Subtracting 1419 from 1474 gives 55 minutes, not a negative duration. Watch for: A 00:xx clock reading after a 23:xx departure needs a next-day label.

Independent extension: Repeat the question after a delay with changed times and explain the first decision independently. Increase one waiting period by five minutes and predict which end time changes. Change one duration or deadline, then predict how the arrival or departure should change before recalculating. Comparing an original attempt with a later independent variant is a stronger retention check than copying the finished timeline.

Compare two complete routes

This group focuses on compare two complete routes. Decide whether to add durations, subtract backwards from a deadline, or enforce a schedule or budget. The same number can represent a clock time or a duration, so label each carefully.

Worked example 21. Question: Leaving at 08:20, Route A is a direct 25-minute bus. Route B takes 12 minutes by train, 10 waiting and 9 walking. Which arrives earlier? Method: Route A duration=25 minutes and arrives 08:45. Route B totals 31 minutes and arrives 08:51. Route A is 6 minutes quicker. Check: Both routes start together and finish at the same destination; the comparison includes all stated stages. Watch for: The train segment alone may be faster even when Route B’s end-to-end trip is slower.

Independent extension: Convert the departure to minutes after midnight, add the duration and then convert back to a clock reading. Find the earliest and latest feasible arrival in the stated scenario, if the information permits. Change one duration or deadline, then predict how the arrival or departure should change before recalculating. Comparing an original attempt with a later independent variant is a stronger retention check than copying the finished timeline.

Worked example 22. Question: Leaving at 08:25, Route A is a direct 28-minute bus. Route B takes 13 minutes by train, 13 waiting and 10 walking. Which arrives earlier? Method: Route A duration=28 minutes and arrives 08:53. Route B totals 36 minutes and arrives 09:01. Route A is 8 minutes quicker. Check: Both routes start together and finish at the same destination; the comparison includes all stated stages. Watch for: The train segment alone may be faster even when Route B’s end-to-end trip is slower.

Independent extension: Make a labelled timeline so a waiting period cannot disappear between two ride segments. Compare the result with a competing route that has fewer transfers but a longer ride. Change one duration or deadline, then predict how the arrival or departure should change before recalculating. Comparing an original attempt with a later independent variant is a stronger retention check than copying the finished timeline.

Worked example 23. Question: Leaving at 08:30, Route A is a direct 31-minute bus. Route B takes 14 minutes by train, 16 waiting and 11 walking. Which arrives earlier? Method: Route A duration=31 minutes and arrives 09:01. Route B totals 41 minutes and arrives 09:11. Route A is 10 minutes quicker. Check: Both routes start together and finish at the same destination; the comparison includes all stated stages. Watch for: The train segment alone may be faster even when Route B’s end-to-end trip is slower.

Independent extension: State whether your answer is a clock time, a number of minutes or a cost; each has a different unit. Explain which unstated information would be needed to use this model for a real Singapore journey. Change one duration or deadline, then predict how the arrival or departure should change before recalculating. Comparing an original attempt with a later independent variant is a stronger retention check than copying the finished timeline.

Worked example 24. Question: Leaving at 08:35, Route A is a direct 34-minute bus. Route B takes 15 minutes by train, 19 waiting and 12 walking. Which arrives earlier? Method: Route A duration=34 minutes and arrives 09:09. Route B totals 46 minutes and arrives 09:21. Route A is 12 minutes quicker. Check: Both routes start together and finish at the same destination; the comparison includes all stated stages. Watch for: The train segment alone may be faster even when Route B’s end-to-end trip is slower.

Independent extension: Before comparing routes, include all the stages requested and apply any affordability or deadline restriction. Use the final answer to recreate the original schedule information as a reverse check. Change one duration or deadline, then predict how the arrival or departure should change before recalculating. Comparing an original attempt with a later independent variant is a stronger retention check than copying the finished timeline.

Whole-journey average speed

This group focuses on whole-journey average speed. Decide whether to add durations, subtract backwards from a deadline, or enforce a schedule or budget. The same number can represent a clock time or a duration, so label each carefully.

Worked example 25. Question: A fictional journey covers 60 km in 2 hours including the total elapsed time specified. Find average speed. Method: Average speed = 60/2≈30.00 km/h. Use total distance divided by the stated whole-journey duration. Check: Multiplying average speed 30.00 by 2 gives approximately 60 km after rounding. Watch for: Do not take an unweighted average of separate speeds or omit a stated wait from total elapsed time.

Independent extension: Check by reversing the operation: a latest-departure result must reach the activity early enough. Draw a two-column table of clock times and elapsed minutes and confirm they are consistent. Change one duration or deadline, then predict how the arrival or departure should change before recalculating. Comparing an original attempt with a later independent variant is a stronger retention check than copying the finished timeline.

Worked example 26. Question: A fictional journey covers 70 km in 2.5 hours including the total elapsed time specified. Find average speed. Method: Average speed = 70/2.5≈28.00 km/h. Use total distance divided by the stated whole-journey duration. Check: Multiplying average speed 28.00 by 2.5 gives approximately 70 km after rounding. Watch for: Do not take an unweighted average of separate speeds or omit a stated wait from total elapsed time.

Independent extension: Distinguish the next scheduled departure from the time interval between services. Increase one waiting period by five minutes and predict which end time changes. Change one duration or deadline, then predict how the arrival or departure should change before recalculating. Comparing an original attempt with a later independent variant is a stronger retention check than copying the finished timeline.

Worked example 27. Question: A fictional journey covers 80 km in 3 hours including the total elapsed time specified. Find average speed. Method: Average speed = 80/3≈26.67 km/h. Use total distance divided by the stated whole-journey duration. Check: Multiplying average speed 26.67 by 3 gives approximately 80 km after rounding. Watch for: Do not take an unweighted average of separate speeds or omit a stated wait from total elapsed time.

Independent extension: Do not use decimal arithmetic on the minute portion of HH:MM notation. Find the earliest and latest feasible arrival in the stated scenario, if the information permits. Change one duration or deadline, then predict how the arrival or departure should change before recalculating. Comparing an original attempt with a later independent variant is a stronger retention check than copying the finished timeline.

Worked example 28. Question: A fictional journey covers 90 km in 3.5 hours including the total elapsed time specified. Find average speed. Method: Average speed = 90/3.5≈25.71 km/h. Use total distance divided by the stated whole-journey duration. Check: Multiplying average speed 25.71 by 3.5 gives approximately 90 km after rounding. Watch for: Do not take an unweighted average of separate speeds or omit a stated wait from total elapsed time.

Independent extension: Check whether a midnight crossing needs a ‘next day’ label in the reported time. Compare the result with a competing route that has fewer transfers but a longer ride. Change one duration or deadline, then predict how the arrival or departure should change before recalculating. Comparing an original attempt with a later independent variant is a stronger retention check than copying the finished timeline.

Choose a feasible route under a fare limit

This group focuses on choose a feasible route under a fare limit. Decide whether to add durations, subtract backwards from a deadline, or enforce a schedule or budget. The same number can represent a clock time or a duration, so label each carefully.

Worked example 29. Question: A hypothetical fast route costs $4 and takes 25 minutes; a slower route costs $3 and takes 40 minutes. The fare budget is $3. Which route is affordable and what is its duration? Method: The faster route costs $4, which exceeds $3. The slower route costs $3, meeting the budget, so it is the feasible choice and takes 40 minutes. Check: The chosen fare equals the available budget, while the faster alternative exceeds it by $1. Watch for: The best feasible route is not necessarily the numerically shortest travel duration.

Independent extension: List which conditions were supplied, and avoid inventing an unstated waiting time. Explain which unstated information would be needed to use this model for a real Singapore journey. Change one duration or deadline, then predict how the arrival or departure should change before recalculating. Comparing an original attempt with a later independent variant is a stronger retention check than copying the finished timeline.

Worked example 30. Question: A hypothetical fast route costs $5 and takes 29 minutes; a slower route costs $4 and takes 43 minutes. The fare budget is $4. Which route is affordable and what is its duration? Method: The faster route costs $5, which exceeds $4. The slower route costs $4, meeting the budget, so it is the feasible choice and takes 43 minutes. Check: The chosen fare equals the available budget, while the faster alternative exceeds it by $1. Watch for: The best feasible route is not necessarily the numerically shortest travel duration.

Independent extension: Repeat the question after a delay with changed times and explain the first decision independently. Use the final answer to recreate the original schedule information as a reverse check. Change one duration or deadline, then predict how the arrival or departure should change before recalculating. Comparing an original attempt with a later independent variant is a stronger retention check than copying the finished timeline.

Worked example 31. Question: A hypothetical fast route costs $6 and takes 33 minutes; a slower route costs $5 and takes 46 minutes. The fare budget is $5. Which route is affordable and what is its duration? Method: The faster route costs $6, which exceeds $5. The slower route costs $5, meeting the budget, so it is the feasible choice and takes 46 minutes. Check: The chosen fare equals the available budget, while the faster alternative exceeds it by $1. Watch for: The best feasible route is not necessarily the numerically shortest travel duration.

Worked example 32. Question: A hypothetical fast route costs $7 and takes 37 minutes; a slower route costs $6 and takes 49 minutes. The fare budget is $6. Which route is affordable and what is its duration? Method: The faster route costs $7, which exceeds $6. The slower route costs $6, meeting the budget, so it is the feasible choice and takes 49 minutes. Check: The chosen fare equals the available budget, while the faster alternative exceeds it by $1. Watch for: The best feasible route is not necessarily the numerically shortest travel duration.

Read a timetable with two rides and a final walk

This group focuses on read a timetable with two rides and a final walk. Decide whether to add durations, subtract backwards from a deadline, or enforce a schedule or budget. The same number can represent a clock time or a duration, so label each carefully.

Worked example 33. Question: At 07:35, a pupil boards Ride 1 lasting 18 minutes, transfers for 7 minutes, takes Ride 2 for 12 minutes and walks 6 minutes. When does the pupil reach school? Method: Add all stages: 18+7+12+6=43 minutes. Arrival=08:18. Check: Reconstructing the four stages on a timeline gives the same total and the same school arrival. Watch for: Do not stop at the second ride’s arrival when a final walk is part of the question.

Worked example 34. Question: At 07:40, a pupil boards Ride 1 lasting 22 minutes, transfers for 9 minutes, takes Ride 2 for 15 minutes and walks 7 minutes. When does the pupil reach school? Method: Add all stages: 22+9+15+7=53 minutes. Arrival=08:33. Check: Reconstructing the four stages on a timeline gives the same total and the same school arrival. Watch for: Do not stop at the second ride’s arrival when a final walk is part of the question.

Worked example 35. Question: At 07:45, a pupil boards Ride 1 lasting 26 minutes, transfers for 11 minutes, takes Ride 2 for 18 minutes and walks 8 minutes. When does the pupil reach school? Method: Add all stages: 26+11+18+8=63 minutes. Arrival=08:48. Check: Reconstructing the four stages on a timeline gives the same total and the same school arrival. Watch for: Do not stop at the second ride’s arrival when a final walk is part of the question.

Worked example 36. Question: At 07:50, a pupil boards Ride 1 lasting 30 minutes, transfers for 13 minutes, takes Ride 2 for 21 minutes and walks 9 minutes. When does the pupil reach school? Method: Add all stages: 30+13+21+9=73 minutes. Arrival=09:03. Check: Reconstructing the four stages on a timeline gives the same total and the same school arrival. Watch for: Do not stop at the second ride’s arrival when a final walk is part of the question.

Determine the available arrival buffer

This group focuses on determine the available arrival buffer. Decide whether to add durations, subtract backwards from a deadline, or enforce a schedule or budget. The same number can represent a clock time or a duration, so label each carefully.

Worked example 37. Question: A pupil arrives at a venue at 10:40 for an activity beginning at 11:00. How many minutes of spare time remain? Method: Subtract arrival clock time from start: 660−640=20 minutes of buffer. Check: Adding 20 minutes to 10:40 reaches exactly 11:00. Watch for: A positive buffer is not an additional travel duration; it measures time remaining after arriving.

Worked example 38. Question: A pupil arrives at a venue at 10:43 for an activity beginning at 11:05. How many minutes of spare time remain? Method: Subtract arrival clock time from start: 665−643=22 minutes of buffer. Check: Adding 22 minutes to 10:43 reaches exactly 11:05. Watch for: A positive buffer is not an additional travel duration; it measures time remaining after arriving.

Worked example 39. Question: A pupil arrives at a venue at 10:46 for an activity beginning at 11:10. How many minutes of spare time remain? Method: Subtract arrival clock time from start: 670−646=24 minutes of buffer. Check: Adding 24 minutes to 10:46 reaches exactly 11:10. Watch for: A positive buffer is not an additional travel duration; it measures time remaining after arriving.

Worked example 40. Question: A pupil arrives at a venue at 10:49 for an activity beginning at 11:15. How many minutes of spare time remain? Method: Subtract arrival clock time from start: 675−649=26 minutes of buffer. Check: Adding 26 minutes to 10:49 reaches exactly 11:15. Watch for: A positive buffer is not an additional travel duration; it measures time remaining after arriving.

Six timetable mistakes to correct before a paper

Treating HH:MM as a decimal number

Convert clock readings to minutes after midnight before calculations. The minute field counts to 60, not 100. The correction should identify the first omitted stage or mistaken clock conversion, then be tested on one fresh scenario without a suggested operation.

Omitting walking, transfer or wait stages

Draw a start-to-destination timeline and include every interval specified by the question. The correction should identify the first omitted stage or mistaken clock conversion, then be tested on one fresh scenario without a suggested operation.

Choosing the fastest ride instead of the earliest arrival

Compare complete route durations from a common start and to a common destination. The correction should identify the first omitted stage or mistaken clock conversion, then be tested on one fresh scenario without a suggested operation.

Working forwards when the departure deadline is the unknown

Start from the required arrival clock time and subtract travel duration plus buffer. The correction should identify the first omitted stage or mistaken clock conversion, then be tested on one fresh scenario without a suggested operation.

Ignoring the start point of a periodic schedule

A frequency such as every 12 minutes does not determine absolute departures without a reference departure. The correction should identify the first omitted stage or mistaken clock conversion, then be tested on one fresh scenario without a suggested operation.

Reporting a negative duration across midnight

Add 1440 minutes for the next day where appropriate and label arrival as next day. The correction should identify the first omitted stage or mistaken clock conversion, then be tested on one fresh scenario without a suggested operation.

How a small-group tutor can make timelines intuitive

In a Secondary 3 G3 Mathematics tutorial in Bukit Timah, a useful first exercise is to ask each pupil to draw the same journey as a timeline and a two-column clock-time table. A student may choose to add durations; another may work backwards from a required arrival. Both are valid when they describe the same schedule consistently.

The tutor can then introduce a misleading route comparison with a fast train but a long transfer wait. Ask each learner to defend the earliest feasible arrival using full end-to-end time, not an isolated ride segment. A final changed timetable without hints helps test whether the model was understood.

The unchanged Clementi Secondary 1 Mathematics small-group guide illustrates an earlier-level teaching approach. For year-level context read the Secondary 3 G3 Mathematics Bukit Timah overview. Current class arrangements and real transport schedules must be checked separately.

A six-week study routine for scheduling problems

Week 1 — clock reading and elapsed time

Practise converting between 12-hour, 24-hour and minutes-after-midnight notation using simple trips. Save an early and a later attempt with new numerical values. The progress to watch is correct model selection and an independent arrival-time check.

Week 2 — multistage timelines

Add walks, rides and waits to a diagram before determining total duration and final arrival. Save an early and a later attempt with new numerical values. The progress to watch is correct model selection and an independent arrival-time check.

Week 3 — reverse departure questions

Use a target event time and specified buffer to recover the latest safe start. Save an early and a later attempt with new numerical values. The progress to watch is correct model selection and an independent arrival-time check.

Week 4 — frequencies and overnight cases

List repeated departures and handle a next-day arrival without negative durations. Save an early and a later attempt with new numerical values. The progress to watch is correct model selection and an independent arrival-time check.

Week 5 — compare feasible alternatives

Use tables containing travel duration, fares and requirements to choose a route that meets the question’s objective. Save an early and a later attempt with new numerical values. The progress to watch is correct model selection and an independent arrival-time check.

Week 6 — solve mixed unfamiliar travel stories

Remove topic headings, ask for an independent timeline and check all event ordering and units. Save an early and a later attempt with new numerical values. The progress to watch is correct model selection and an independent arrival-time check.

Frequently asked questions

How do I add 45 minutes to 08:35?

Convert or carry minutes normally: 08:35 plus 45 minutes is 09:20. Test the explanation with one changed schedule and a complete forward check.

Why is 08:30 not eight-point-three hours?

The clock uses sixty minutes per hour; 30 minutes represents half an hour. Test the explanation with one changed schedule and a complete forward check.

What is a transfer wait?

The time between reaching a connection point and beginning the next ride. Test the explanation with one changed schedule and a complete forward check.

Is the fastest vehicle always the fastest route?

No. Waiting, walking and transfers can change total arrival time. Test the explanation with one changed schedule and a complete forward check.

How do I find the latest departure?

Work backwards from the required arrival, subtracting all travel durations and the stated buffer. Test the explanation with one changed schedule and a complete forward check.

What if a trip crosses midnight?

Add 1440 minutes when interpreting the next day, then report the correct day and clock time. Test the explanation with one changed schedule and a complete forward check.

Can I find a service’s next departure from its frequency alone?

Not without a starting departure, phase or other reference timetable information. Test the explanation with one changed schedule and a complete forward check.

How do I decide which route is best?

Follow the specified objective, such as earliest feasible arrival, fare budget or transfer limit. Test the explanation with one changed schedule and a complete forward check.

Does SEC G3 Mathematics include transport contexts?

The 2027 K310 syllabus expressly lists travel, excursion plans and transport schedules as examples of real-world contexts. Test the explanation with one changed schedule and a complete forward check.

Are the schedules on this page actual Singapore schedules?

No. Every timetable is intentionally hypothetical for Mathematics practice. Test the explanation with one changed schedule and a complete forward check.

Official reference: 2027 SEC G3 Mathematics K310, Real-World Contexts and N4 Rate and Speed, and the SEAB G3 subject listing. This is original instructional practice, not an official timetable, travel recommendation or examination paper.

The takeaway

Did you know? One reliable habit can make an unfamiliar timetable problem much easier: put every event on a timeline. Distinguish clock time from duration, include the specified transfers and waits, and check that the chosen route really satisfies the arrival or budget condition. Then the arithmetic becomes ordinary addition, subtraction and comparison.

Secondary 3 G3 Mathematics Tutor Bukit Timah | Transport Timetables: Journey Times, Connections and Arrival Planning