Measurement and Data

Let's start with one of the most reliably scorable question types in OC MR Measurement: adding a large number of minutes to a given time. The trick is that students who try to count minute-by-minute lose time and make errors — students who know the two-step conversion breeze through.

Time-addition problems appear in virtually every OC MR paper, usually in the first half of the test. They are worth securing early — a confident solve here frees up time for harder questions later.

The examiner is checking whether you can convert a raw minute count into hours and leftover minutes, add the hours to the start time (handling midnight or noon crossings), and then add the remaining minutes — without confusing am and pm.

A start time is given in 12-hour format (e.g. 10:25 pm). A large number of minutes is added — often 200–600 minutes, enough to cross midnight. You must give the final time in 12-hour format, including the correct am/pm.

Raj buys 8 soft drinks and pays with a $20 note, getting $8 change. How much did each drink cost? Two simple steps: find the total spent (20 − 8 = 12), then divide by the number of items (12 ÷ 8 = 1.50). The classic trap is option C ($1.00) — students who divide the change ($8) by the number of drinks instead of the amount spent.

Unit price problems (total spent from change, then divide) are among the most common very-easy money questions in OC MR. They appear at the beginning of the paper and are solved in two steps. The examiner always provides a distractor equal to change ÷ quantity to catch students who confuse 'change' with 'amount spent'.

The examiner tests whether students can first find the total spent from the note and change, then divide by the number of items. Option C ($1.00) is the deliberate trap: $8 ÷ 8 = $1.00 is what students get if they divide the change by the number of drinks rather than the amount spent.

A quantity of identical items is bought. A large note is used to pay. The change is given. Students must: (1) subtract change from note to find total spent, (2) divide total spent by the number of items to find the unit price.

A packet of nuts weighs 25 grams. How many packets weigh half a kilogram? Two steps: convert half a kg to grams (500 g), then divide (500 ÷ 25 = 20). Option D (40) is a deliberate trap for students who forget to halve — they compute 1000 ÷ 25 = 40 using a full kilogram instead of half.

Unit conversion and division problems (grams to kilograms or back) appear at the very-easy end of OC MR. They test the kg ↔ g conversion (1 kg = 1000 g) and a simple division. Option D (full kg trap) is a standard examiner move to catch students who rush past the word 'half'.

The examiner tests two skills: converting 'half a kilogram' to grams (500 g), and dividing that by the packet weight. Option D (40) traps students who use 1000 g (1 full kg) instead of 500 g. Option A (2) traps students who misread 25 g as 250 g.

A unit weight (in grams) is given. A target weight in kilograms (or a fraction of a kg) is stated. Students must convert the target to grams, then divide to find the number of packets/items.

Ophelia has 12 clay lumps: 100g×2, 50g×1, 5g×3, 2g×3, 1g×3. Total = 200+50+15+6+3 = 274g. Split equally → 137g each. Option E (274g) traps students who forget to halve; option A (87g) catches those who miss the two 100g lumps.

Multi-group summing then halving is an easy-level OC MR question type. Students must multiply within each group, add across groups, then divide by 2. Careful counting of groups (the question says 12 lumps) provides a built-in check.

The examiner tests systematic addition of grouped items and halving. Option E (274 g — the total) is the classic 'forgot to halve' trap. The unusual denominations (100, 50, 5, 2, 1) are designed to require careful grouped multiplication rather than simple counting.

An object is described as a collection of smaller items with given weights or values, grouped by denomination. The items are combined and then split equally. Students must total all items and divide by the number of pieces.

20 boxes (400 g each) must be packed into bags that hold at most 1.5 kg. The key traps: forgetting to convert kg to g, and forgetting the leftover boxes after dividing. If you just divide 20 by 3 and ignore the remainder, you get 6 — and leave 2 boxes unpacked!

Packing/grouping problems with a unit-conversion twist (kg ↔ g) appear regularly in OC MR at easy–medium difficulty. They combine two skills: unit conversion and ceiling division (always round up the number of containers, never round down).

The examiner tests two things at once: (1) whether students convert 1.5 kg to 1500 g before dividing, and (2) whether they round up after division. Option C (6) is the most common trap — students do the division correctly but forget the 2 leftover boxes need a 7th bag.

A number of identical items (each with a given mass in grams) must be packed into containers (with a capacity given in kilograms). Students convert units, find how many items fit per container, divide the total items, and round up to find the minimum number of containers.

Liu Wei boards a train at twenty to midnight and gets off at 2:45 pm the next day. The phrase 'twenty to midnight' is a classic trap — students who convert it incorrectly (to 12:20 am instead of 11:40 pm) get an answer that's 40 minutes off. The key technique is to break the journey at midnight and add the two segments.

Time elapsed questions that cross midnight (or noon) appear in the medium difficulty band of OC MR. The 'X to Y' time format (e.g. 'twenty to midnight' = 11:40 pm) is a reliable trap — roughly 1 in 3 students misread it. Breaking at midnight is the standard technique that eliminates all confusion.

The examiner is testing two skills together: translating 'twenty to midnight' correctly (11:40 pm, not 12:20 am) and calculating elapsed time across midnight into the next afternoon. Option D (14h 45min) catches students who correctly count midnight to 2:45 pm but forget the 20-minute segment before midnight.

A person's journey or event starts at a time expressed using 'X to Y' format (e.g. 'twenty to midnight' = 11:40 pm, 'a quarter to 8' = 7:45) and ends at a given clock time the following day. The total elapsed time spans midnight, requiring students to handle both pm-to-midnight and midnight-to-pm segments.

Dog food comes in two sizes: 500 g for $1 and 2.5 kg for $4.50. Joe needs exactly 4 kg. What's the cheapest way to get there? This is a combination problem — you must first find all combinations of boxes that total exactly 4 kg, then compare costs. Options A to D are traps: they look cheaper but don't actually sum to 4 kg.

Minimum-cost combination questions (find the cheapest way to meet an exact quantity) appear in the medium difficulty band of OC MR. They require testing a small number of combinations and comparing costs. The most common mistake is picking the cheapest-sounding option (A, $5.50) without verifying it totals the required quantity.

The examiner is testing whether students can systematically find all valid combinations (0, 1, or 2 large boxes) and check that each totals exactly 4 kg before comparing costs. Options A–D are all plausible-looking prices that correspond to real combinations of boxes — but none of them add up to 4 kg. Only $7.50 (1 large + 3 small) achieves the exact 4 kg target.

Two pack sizes are given with different per-unit prices. A specific total quantity must be achieved exactly. Students must find all valid integer combinations of the two pack sizes that sum to the required quantity, calculate the cost of each valid combination, and select the minimum. Two to three valid combinations exist; the cheapest is not always the one that uses the most large packs.

11 August 1999 was a Wednesday. What day was 21 September 1999? The whole challenge is counting the days in between correctly (20 remaining in August + 21 in September = 41), then using remainder division to find which day of the week that lands on.

Cross-month day-of-week questions appear regularly at the medium difficulty tier of OC MR. They test two skills: accurate day counting across a month boundary, and remainder arithmetic mod 7. The most common error is miscounting the days (e.g. counting from the 11th as 0 instead of adding full days).

The examiner tests careful counting and modular arithmetic. Option D (Monday) traps students who count 40 days instead of 41 (a common off-by-one error). The landmark-Wednesday check (22 Sep is a Wednesday, so 21 Sep is Tuesday) provides an elegant verify step that catches errors quickly.

A date and its day of the week are given. A second date — usually in the same year but one to three months later — is asked. Students count the gap in days, divide by 7 to find the remainder, then count forward that many days from the starting day.

A clock shows 5:55 am. Add 555 minutes. The key insight: 555 ÷ 60 = 9 remainder 15 — so you add 9 hours and 15 minutes. 5:55 am + 9 h = 2:55 pm, then + 15 min = 3:10 pm. Option E (3:50 pm) traps students who add 50 minutes instead of 15.

Adding large numbers of minutes to a clock time is a staple medium-level OC MR question. Students must convert minutes → hours + remaining minutes, then add hours first, then add the leftover minutes. AM-to-PM crossings add one more layer of care.

The examiner tests whether students can convert a large minute total into hours and minutes (division with remainder), then correctly advance a clock time across the noon boundary. Option E (3:50 pm) traps those who use 555 mod 60 = 55 instead of 15 as the leftover minutes.

A starting clock time is given (often close to the hour for a neat remainder). A large number of minutes is added. Students must divide by 60 to split into hours + minutes, then add each part separately.

Sarah catches the 8:50 am bus from Forster to Coffs Harbour, then gets a bus home arriving Forster at 9:19 pm. A timetable with two services in each direction is provided. The challenge: identify the correct column for each journey, read off the Coffs Harbour times, then subtract to find time spent there.

Timetable reading with elapsed time calculation is a staple of OC MR and appears in most exam papers at medium difficulty. Students must select the correct row AND the correct column (right service), then calculate elapsed time between non-round numbers (e.g. 1:39 pm to 4:25 pm). It combines table literacy with mental time arithmetic.

The examiner is testing two things: (1) reading the correct column — the 8:50 am Forster service gives a 1:39 pm arrival, not 11:49 am; and (2) computing elapsed time correctly, especially when the minutes don't round neatly. Option E (7 h 40 min) traps students who measure total travel time (8:50 am to 9:19 pm) rather than time at the destination.

A timetable shows multiple services between several stops. A scenario describes a person catching a specific named service (identified by departure time from a named stop) and returning on a service identified by its arrival time. Students must find the matching column in each direction, read the relevant times, and calculate the elapsed time between arrival and departure at the destination.

Now for a more demanding money problem — one where the total change is fixed but the coin mix is constrained. These questions test whether you can work through the constraints in the right order rather than jumping straight to the answer.

Constrained coin-change problems appear in the top-difficulty third of OC MR papers. They separate students who can handle multi-step constraints from those who rush to an answer without reading every condition.

The examiner is testing whether you read all the constraints before calculating. The key constraint — "exactly six 50-cent coins" — must be processed first to find the remaining amount, which is then expressed entirely in the smaller coins you are asked to count.

A customer buys items, pays with a note, and receives change. The change is described with one coin type already fixed (e.g. exactly six 50-cent coins). You are then asked to maximise or find the count of a different coin denomination from what remains.

Susie pays $10 for a $2.20 purchase and gets $7.80 change. The catch: no $1/$2 coins, no notes, and the change has EXACTLY nine 50c coins. The remaining $3.30 must come from 20c, 10c, and 5c coins. What is the MOST 20c coins she can have? This is a two-step constraint problem — first pin down the remaining amount, then maximise one coin denomination.

Coin constraint problems (maximise or minimise a denomination given a fixed total and exclusions) appear regularly in the difficult tier of OC MR. They require both money arithmetic and a systematic trial: try the maximum possible, check if the remainder can be made with allowed coins, adjust down if not.

The examiner is testing multi-step money reasoning plus constraint satisfaction. Option A (14) is placed to trap students who try to include a 10th fifty-cent coin to cover the remaining 50c after 14 × 20c = 280c — but the problem says exactly nine 50c coins. Option C (17) traps students who try 17 × 20c = 340c without noticing it exceeds the 330c remaining.

A purchase is made with a large note; change is given. A constraint fixes how many coins of one denomination appear. Students must find the remaining amount and then maximise (or minimise) a second denomination, using only the allowed coin types. The key skills are: compute change, subtract fixed-denomination coins, then optimise.