Data Sufficiency (Quant) — IBPS PO
Quant data sufficiency uses the same framework as reasoning DS — the fixed 5-option key, "each statement alone first" — but applied to numerical problems. The winning mindset is identical: you are deciding whether the data is enough to find a unique value, not computing that value. For most quant DS you don't even solve — you just count whether you have as many independent equations as unknowns. At 3–5 Mains marks, judging solvability instead of grinding out the arithmetic is what makes these fast.
1. What IBPS actually asks
A numerical question ("Find the two-digit number", "What is A's age?", "Find the speed of the train") with two statements, and the fixed key:
- I alone sufficient 2. II alone sufficient 3. Either alone 4. Both together 5. Neither even together.
(Three-statement variants exist; same logic, more combinations.) Read the exact option order printed with the set.
2. The iron rule (same as reasoning DS)
- Test Statement I alone (cover II): does it pin a unique value? yes/no.
- Test Statement II alone (cover I): unique value? yes/no.
- Combine only if neither alone works.
- Map to the key.
Never look at both statements together first — evaluate each in isolation.
3. Count equations vs unknowns (the shortcut)
For most quant DS, you don't solve — you count independent equations against unknowns:
- n unknowns need n independent equations for a unique solution.
- "Find x and y" with one statement giving
x + y = 10and anotherx − y = 4⇒ two equations, two unknowns ⇒ both together sufficient (neither alone). - Watch for dependent equations:
2x + 2y = 20andx + y = 10are the same equation — together they're still insufficient.
The moment you see you have enough independent relations to fix the unknowns, it's sufficient — stop; don't solve.
4. Unique value, not just "a value"
Sufficiency means a single answer:
- A quadratic from one statement may give two roots — if both are valid (e.g. both positive ages), it's not sufficient (ambiguous).
- A statement giving a ratio (a:b = 3:4) without an absolute value can't fix the actual numbers alone.
- "Is x even?" needs a definite yes/no — a statement that forces "x is a multiple of 4" answers it (yes) and is sufficient.
5. Trap watch
- Assuming positivity/integrality not stated — a value could be negative or fractional unless the question restricts it.
- Over-solving — you rarely need the actual number; you need to know it's uniquely determined.
- Dependent equations looking like two pieces of information when they're one.
- The either–or case: when each statement alone independently pins the same unique value, the answer is "either alone sufficient".
Solved examples
Q1. Find the two-digit number. (I) The sum of its digits is 9. (II) The number is divisible by 9 and lies between 40 and 50.
Show explanation
Solution. (I) alone: many numbers (18, 27, 45…) — not unique. (II) alone: divisible by 9 between 40–50 ⇒ 45, unique ⇒ II alone sufficient (option 2).
Q2. Find x and y. (I) x + y = 12. (II) x − y = 4.
Show explanation
Solution. Each alone: one equation, two unknowns ⇒ not sufficient. Together: two independent equations ⇒ x=8, y=4 ⇒ both together (option 4).
Q3 (dependent). Find x and y. (I) 2x + 3y = 13. (II) 4x + 6y = 26.
Show explanation
Solution. (II) is just 2×(I) — the same equation. Together still one equation, two unknowns ⇒ even both not sufficient (option 5).
Q4 (ambiguous root). Find the value of x. (I) x² = 49.
Show explanation
Solution. x = +7 or −7 — two values ⇒ (I) alone not sufficient (unless the question restricts x > 0).
7. The protocol
- Read the exact option key printed with the set.
- Test each statement alone (cover the other): does it fix a unique value?
- Count independent equations vs unknowns rather than solving.
- Combine only if neither alone works; watch for dependent equations.
- Beware two-root ambiguity and unstated assumptions; if each alone fixes the value, it's either–or.
