Data Sufficiency (Reasoning) — IBPS PO

Data sufficiency flips the usual question: you are not asked to find the answer, only to decide whether the statements give enough to find it. That single shift is where marks are won and lost — candidates waste a minute solving a puzzle when they only needed to see that it could be solved. In IBPS these are 3–5 marks (Prelims and, more often, Mains), applied to seating, blood relations, direction and coding. Learn the fixed option framework and one iron rule — judge each statement alone before combining — and DS becomes among the fastest reasoning marks.

1. What IBPS actually asks

A question stem (e.g. "Who sits second to the left of P?") followed by two or three statements, and you choose from a fixed answer key:

1. Statement I alone is sufficient, but II alone is not.
2. Statement II alone is sufficient, but I alone is not.
3. Either statement alone is sufficient.
4. Neither alone, but both together are sufficient.
5. Even both together are not sufficient.

(Some sets use three statements with variants — the logic is identical, just more combinations.) The exact wording of the options is printed with the set — read it once, because the option order occasionally changes.

2. The one iron rule: each statement alone, first

1. Cover Statement II. Ask: does I alone answer the question? Note yes/no.
2. Cover Statement I. Ask: does II alone answer the question? Note yes/no.
3. Only if neither alone works, combine them and ask if together they answer it.
4. Map your yes/no results onto the option key.

The number-one DS error is peeking at both statements together from the start. Evaluate them in isolation — the whole framework depends on it.

3. Sufficiency means "a unique answer", not "an answer you like"

A statement is sufficient if it pins down a single, definite answer — even if that answer is "no". It is insufficient if it leaves two or more possibilities.

• "Who is tallest?" + "A is taller than B" → insufficient (says nothing about C, D…).
• "Is M sitting at an end?" + "M sits third from P, who is at an end" → this may pin M's seat uniquely → sufficient.

Ask: after this statement, is there exactly one possible answer? If yes, sufficient.

4. Don't solve — just check solvability

For a seating or puzzle DS, you rarely need the full arrangement. You need only to know whether the statement(s) force a unique configuration for the asked element.

• If a single statement fixes enough anchors to determine the queried position, it's sufficient — stop, don't finish the grid.
• If it leaves the queried element in two possible spots, it's insufficient.

This "solvability, not solution" mindset is the time-saver.

5. Trap watch

• The assumption trap: don't assume anything not stated (a name is male, a row has exactly 6 people) unless the stem says so.
• The over-solve trap: finishing a full puzzle when a partial deduction already settles sufficiency.
• The "both look needed" trap: verify each truly fails alone before choosing option 4 — sometimes one alone is quietly sufficient.
• Answer can be "no": a statement that definitively proves "M is NOT at an end" is sufficient — sufficiency is about definiteness, not positivity.

7. The protocol

1. Read the exact option key printed with the set.
2. Evaluate Statement I alone (cover II): unique answer? yes/no.
3. Evaluate Statement II alone (cover I): unique answer? yes/no.
4. If neither alone, test both together.
5. Map to the key; remember sufficiency = a single definite answer (even "no"), and check solvability, don't solve.