UCAT PlaybookChapter 2 of 8

Decision Making

Six kinds of question share one rule. Use only what is on the screen, and work out what must follow from it. A feeling that something is true counts for nothing here.

questions: 35questions
minutes: 37minutes
each, about: 63 seach, about

The first question to ask, by type

You have about a minute each. Spend the first ten seconds naming the type, because each one has a different first move.

Syllogisms and yes or no

Ask: does this follow from the statements alone? Draw the groups as circles or a short chain, then test each conclusion against the drawing, never against what sounds right.

Logic puzzles

Ask: must this be true, or could it? Sketch one arrangement that fits every rule. Then try to build a second one that also fits. If you can, the thing that changed between them is only could.

Venn diagrams

Ask: is the question about a whole circle, or one region? Label the overlaps first, then read the number the question actually wants.

Probability

Ask: and, or, or given? Both things happening multiplies. Either happening adds. Given narrows the pool before you count.

Strongest argument

Ask: does this argument talk about the exact decision in the question? The strongest one speaks to the proposal itself, with a reason, not a feeling and not a side issue.

Interpreting information

Ask: is the conclusion in the data, or in my head? Read the table’s title and units, then check each statement against a single cell or row.

Four traps, and how to dodge them

Each one has a name, an example and a fix. The puzzles and numbers are made up for this page.

Could read as mustA possible arrangement was taken as forced.

Five friends finish a fictional fun run. Ari finishes before Ben. Ben finishes before Cam. Dee finishes after Ari. Eli is not last.

Which of these must be true?

ADee finishes last.
BAri finishes before Cam.the right answerRight
CBen finishes before Dee.the trap pickTrap
DCam finishes last.

Dee only has to finish after Ari. Eli, Ari, Dee, Ben, Cam fits every rule, and so does Eli, Ari, Ben, Cam, Dee. Ben before Dee is possible, not forced. B follows from Ari, then Ben, then Cam, every time.

FixIf it can be arranged two ways, it is could, not must. Build the second arrangement before you answer.

Total read as onlyA whole circle was read as one region.

A fictional school club asks 40 students which of chess and drama they do. In the Venn diagram, 14 sit in chess only, 9 in both, 11 in drama only, and 6 do neither.

How many students do chess?

A14the trap pickTrap
B23the right answerRight
C9
D34

The chess circle holds two regions: chess only (14) and both (9). The question asks who does chess, not who does only chess. 14 + 9 = 23.

FixSay the words only or whether or not before you add. One means a region, the other means the whole circle.

Wrong operationAdded when the events both had to happen.

A fictional bag holds 3 red tokens and 2 blue tokens. You take one token, put it back, mix the bag, and take one again.

What is the probability that both tokens are red?

A6/5the trap pickTrap
B9/25the right answerRight
C3/10
D6/25

Both draws have to be red, so the chances multiply: 3/5 times 3/5 = 9/25. Adding gives 6/5, which is more than certain, a sign the operation was wrong. The token goes back, so the second draw is still 3 in 5.

FixSay and or or out loud. And multiplies. Or adds. A probability above 1 means you picked the wrong one.

Off targetA true point that is not about the decision.

Should a fictional town council make the main street car free on Sundays?

Which is the strongest argument?

ANo, because the council was slow to repair the street last winter.the trap pickTrap
BYes, because a trial in the town showed Sunday foot traffic to shops rose while deliveries were moved to the morning.the right answerRight
CNo, because cars are a normal part of town life.
DYes, because many people enjoy walking.

A might be true, but it is about repairs, not about Sundays without cars. B gives evidence about this exact proposal and answers the obvious objection. C and D are feelings with no reason attached.

FixRead the proposal twice. An argument that would work for any proposal, or for a different one, is off target.

Try one

A five runner relay puzzle. Sketch the order before you look at the options.

Set 1

01:03

In a fictional relay, Nia, Owen, Priya, Luca and Mae each run one of five consecutive legs. Their order follows these rules:

Luca runs immediately before Mae.

Nia runs before Luca.

Owen runs before Priya.

Question 1

Which statement MUST be true?

AOwen runs before Mae.BNia runs before Mae.CPriya runs before Luca.DMae runs before Priya.

The trap method for Decision Making

Name the trap

For every miss, pick which of the 4 above caught you. Never careless. The name.

Could read as must

Write your rule

One line, in your words, that would have saved you. Keep it on one sheet.

If it can be arranged two ways, it is could.

Dodge it three times

On new questions. When it has not caught you three times running, cross it off.

Retired

The whole method, in chapter 7

In Cutline UCAT this happens on its own: almost every miss gets its trap, the Train tab says Fix could read as must, and the trap retires after three clean, in-time dodges.

Start practising free

Get the Playbook by email

The link to every chapter, in your inbox, for when you come back to it.

Next chaptercutline.nz/ucat/playbook/quantitative-reasoning

Chapter 3 of 8Quantitative ReasoningThe calculator, the shortcuts, and the 43 seconds you actually have per question.Keep reading

Written and checked by Edwin Tie, an Otago medical student, with the Cutline team. Last checked 31 October 2026. The examples on this page are invented for it, not taken from a real UCAT paper.