The Decision Tree in CAT Quant Problems
Most CAT Quant questions branch, and finding out halfway costs the question. The Branch Map lists the cases and prunes them in about thirty seconds.

There is a question type that punishes good solvers more reliably than any other: the one with cases. Absolute values that split into two. A quadratic whose roots might be positive or negative. An arrangement where one person may or may not be included. Nothing in the mathematics is hard. What is hard is that the question quietly branched, and you only noticed after committing to one branch.
The aspirants who handle these well are not faster. They spend the first thirty seconds doing something that looks like nothing at all: mapping where the question can go before travelling down any of it.
- Most CAT Quant questions branch, and the expensive mistake is discovering the branch halfway down one of them.
- The Branch Map is three steps: list the branches, prune with constraints, then order what survives by cost.
- Constraints kill branches far faster than algebra explores them. Most maps collapse from four routes to one before any solving.
- Solving the cheapest surviving branch first is not laziness. A branch that resolves quickly often eliminates the others by contradiction.
- Mapping costs about thirty seconds and reliably saves two to four minutes on any question with cases.
Why Questions Branch, and Why You Miss It
A branch appears whenever something in the question can be true in more than one way. The usual sources are unremarkable: a modulus, a square root, an inequality, an unstated sign, a case where a quantity might be zero, a selection that may or may not include a particular element.
None of these announce themselves. A modulus sign is one character. An unstated positivity assumption is not written at all. So the standard failure is not misunderstanding the branch, it is never registering that there was one, and then producing a completely correct answer for one case out of two.
The reason it goes unnoticed is that branches are written in very small print:
- A modulus is a single character and reads as punctuation.
- A squared term destroys sign information silently, with nothing on the page to mark it.
- An unstated positivity assumption is, by definition, not written at all.
- An optional element in a story reads as narrative detail rather than as a fork.
What makes this so costly is the timing. You discover the second branch either at the end, when your answer is not among the options, or never. Both outcomes cost the full question, and the second one costs it invisibly.
The Branch Map: Three Steps Before You Solve
The map is not a diagram you draw carefully. It is three or four words in the margin, and its whole purpose is to make the branches exist on paper rather than in memory.
The Branch Map
- List the branches. Before any algebra, name every way the question could split. Two to four is typical. Write them as short labels, not as equations.
- Prune with constraints. Apply each given restriction to the list. Most branches die immediately against positivity, integrality or a stated bound.
- Order what survives by cost. Solve the cheapest surviving branch first. Cheap branches often kill the others by contradiction, for free.
Listing the branches is a scan for a small, fixed set of triggers. Once you know them, it takes seconds:
- A modulus or absolute value: two branches, one for each sign of the inside.
- An even power or a square root: sign information has been destroyed and must be restored by hand.
- An inequality with a variable multiplier: the direction flips if the multiplier is negative.
- Any "may or may not" in the story: an element included or excluded, a case where a quantity is zero.
Pruning is where the time is won, because constraints eliminate far faster than algebra explores. Run the given conditions against your list before touching any branch:
- Positivity kills the negative branch outright in most geometry and rate questions.
- An integer condition kills fractional branches without any computation.
- A stated range removes anything outside it, which frequently leaves exactly one case.
- Physical sense removes the rest: negative people, times before the start, discounts above the price.
Ordering by cost is the step aspirants skip, and it is nearly free. Among surviving branches, pick the one with the smallest numbers or the fewest unknowns first:
- A branch that resolves in thirty seconds tells you whether you even need the others.
- If a cheap branch produces a valid answer that appears in the options, the expensive branch is often redundant.
- If a cheap branch produces a contradiction, you have eliminated it for almost nothing.
Put the Branch Map to Work
Mapping only becomes automatic against questions that genuinely branch. Optima Learn's Quant sets follow real CAT patterns, so the case-based questions appear the way they will in the exam.
Practise CAT Quant QuestionsThe Triggers That Create Branches
Almost every branch in CAT Quant comes from one of a handful of sources. Knowing them turns the scan into recognition.
| Trigger | Branches it creates | What usually prunes it |
|---|---|---|
| Modulus | Inside positive, inside negative | A stated range on the variable |
| Square root or even power | Positive root, negative root | Physical positivity |
| Inequality times a variable | Multiplier positive, negative, zero | A sign condition in the given |
| Selection or arrangement | Element included, excluded | A count or distinctness condition |
| Quadratic with two roots | One root valid, both, neither | Integrality or a context bound |
The third column matters more than the second. Every one of these is routinely pruned by a condition that is already in the question, which is why mapping so rarely leads to solving four cases. It leads to solving one and knowing why the others are dead.
How Far to Map Before You Start
The map is a sketch, not a specification, and over-mapping is a real failure mode. A few limits keep it cheap:
- One level deep, not two. Map the branches the question creates now. Sub-branches usually vanish once the first level is pruned.
- Labels, not equations. "x positive" and "x negative" is enough. Writing out each case in full is doing the work you were trying to avoid.
- Stop at four. More than four branches almost always means you have mapped the wrong thing, or the question wants a structural insight rather than enumeration.
- Thirty seconds maximum. If the map is not settled by then, the question is a candidate to leave.
- Do not map what cannot branch. A question with no modulus, no even power and no optional element does not need this step at all.
Deciding how much structural work is worth doing before you start is the same judgement covered in why every CAT Quant question has a point of no return. Mapping is cheap; mapping forever is a way of not starting.
How Many Cases a CAT Quant Question Usually Has
Mapping feels expensive because aspirants imagine large trees. Real CAT questions are much smaller than that, and knowing the usual sizes makes the step feel affordable.
- Most questions: none. No modulus, no even power, no optional element means no branching and no map.
- A single modulus: two cases, and one of them is usually killed by a stated range.
- A quadratic in context: two roots, of which typically one survives an integrality or positivity condition.
- Two interacting triggers: four on paper, but rarely more than two after pruning.
- More than four surviving cases is a signal you have mapped the wrong thing, or the question wants a structural insight instead of enumeration.
Common Mistakes That Come From Not Mapping
The same omission shows up in several forms:
- The dropped negative. Taking only the positive square root because the context looked physical, when the variable was not a length.
- The unflipped inequality. Multiplying through by a variable of unknown sign and keeping the direction.
- The forgotten boundary. Solving the strict cases and losing the equality case, which is often the answer.
- Mapping after failing. Discovering the second branch at minute four, having already spent the budget on the first.
- Solving every branch. Working all four cases fully when three would have died against a constraint in ten seconds.
A Practice Drill for Mapping First
As with most structural habits, the drill works by forbidding the solving.
- Take fifteen Quant questions containing at least one modulus, inequality or selection. Do not solve them.
- For each, write the branch list in the margin as short labels, then strike through every branch a given condition kills.
- Count what survives. Predict, before solving, how many cases you will actually have to work.
- Now solve them and check the prediction. Note every branch you failed to list at all, because those are the triggers you do not yet see.
Most aspirants find their misses cluster on one trigger. Unflipped inequalities and lost equality boundaries are the two most common, and both are recognition problems rather than knowledge problems, which is why they respond to this drill quickly.
The Bottom Line
A question with cases is not asking you to do more work. It is asking whether you noticed the work had a shape. Thirty seconds spent drawing that shape is the difference between solving one case correctly and solving the right one.
The Branch Map, Recap
- List the branches: modulus, even powers, variable-sign inequalities, optional elements.
- Prune with constraints: positivity, integrality, stated ranges, physical sense.
- Order by cost: solve the cheapest survivor first; it often kills the rest.
Build the Habit on Timed CAT Quant
Mapping is the step that disappears first when the clock is running, so it has to be trained against one. Work through CAT previous year questions in timed blocks, or sit full CAT mock tests and past papers so the habit holds under real fatigue. There is more on question construction in the CAT Quant blog archive, and if missed cases keep costing you marks it is worth having your preparation reviewed honestly.
Frequently Asked Questions
What is a decision tree in a CAT Quant problem?
It is the set of distinct ways the question can resolve, created by things like a modulus, an even power, a variable-sign inequality or an optional element. Mapping it means listing those routes before solving, so that none of them can be discovered accidentally halfway through.
How do I know when a question has cases?
Scan for a fixed set of triggers: modulus signs, square roots and even powers, inequalities multiplied by a variable, and any element in the story that may or may not be included. If none are present the question does not branch and this step can be skipped entirely.
Doesn't mapping the cases take too long?
It takes about thirty seconds because it is short labels rather than worked equations, and most of the branches die immediately against a condition already in the question. It replaces the far larger cost of discovering a branch at minute four, after the budget for the question is gone.
Which branch should I solve first?
The cheapest survivor: the one with the smallest numbers or the fewest unknowns. A branch that resolves quickly frequently eliminates the others, either by producing an answer that matches the options or by producing a contradiction that rules its case out for almost no cost.
Map Before You Solve in CAT 2026
Thirty seconds of structure before the first line of algebra is the cheapest insurance in the section. Build the habit against real CAT-style questions.
Start Practising CAT QuantDrill these Quant concepts on real PYQs
20,000+ tagged CAT Quant PYQs, sorted by difficulty and topic.