Module 1 · IBPS PO Reasoning Ability

Data Sufficiency

Updated 17 Nov 2026 · 4,574 words
Updated 21 Nov 2026
Determine if given data is sufficient to answer a question.
Sufficiency Analysis · Data Adequacy · Statement Combinations
🎯 Take Mock Test

Learning Objectives

  • Understand the fundamental concepts of Data Sufficiency
  • Apply key formulas and techniques to solve problems
  • Practice with exam-level questions to build speed and accuracy

What is Data Sufficiency?

Data Sufficiency questions test your ability to determine whether the given data is sufficient to answer a question, without actually solving it completely. Each question is followed by two statements (I and II). You must decide if statement I alone, II alone, both together, or neither is sufficient. These questions appear in mains exams.

Answer Choices

In such questions, the standard options are: (a) Only statement I alone is sufficient; (b) Only statement II alone is sufficient; (c) Both statements together are sufficient, but neither alone is sufficient; (d) Both statements together are not sufficient; (e) Either statement I or II alone is sufficient.

Types of Data Sufficiency Questions

1. Age/Relation Based: Find ages of persons based on given relationships. Statements provide ratios, sums, or differences of ages.

2. Number Based: Find a number based on its properties — factors, multiples, digits, operations.

3. Percentage/Profit Based: Find profit percentage, discount, or marked price based on given transaction details.

4. Speed-Distance Based: Find speed, time, or distance based on motion parameters.

5. Comparison Based: Determine which is larger/smaller between two quantities based on given relationships.

Solved Examples

Example 1 (Age Problem)
What is the present age of A?
Statement I: The ratio of A's age to B's age 5 years ago was 3:4.
Statement II: B's present age is twice A's age 10 years ago.

a) Only I b) Only II c) Both together d) Neither e) Either
Solution: c) Both together are sufficient. Let present ages be A and B. From I: (A-5)/(B-5) = 3/4 → 4A - 20 = 3B - 15 → 4A - 3B = 5. From II: B = 2(A-10) → B = 2A - 20. Two equations, two unknowns. Solving: 4A - 3(2A-20) = 5 → 4A - 6A + 60 = 5 → -2A = -55 → A = 27.5 years. Neither statement alone gives a unique answer, but together they do.
Example 2 (Number Problem)
Is the integer N divisible by 12?
Statement I: N is divisible by 4.
Statement II: N is divisible by 3.

a) Only I b) Only II c) Both together d) Neither e) Either
Solution: c) Both together are sufficient. For a number to be divisible by 12, it must be divisible by both 3 and 4 (since 12 = 3 × 4, and 3 and 4 are coprime). Statement I alone → divisible by 4 but not necessarily by 3 (e.g., 8). Statement II alone → divisible by 3 but not necessarily by 4 (e.g., 9). Together → divisible by both 3 and 4 → divisible by 12.
Example 3 (Profit-Loss)
What is the profit percentage earned by selling an article?
Statement I: The selling price is ₹240 more than the cost price.
Statement II: The selling price is 120% of the cost price.

a) Only I b) Only II c) Both together d) Neither e) Either
Solution: b) Only II alone is sufficient. Profit % = (SP - CP)/CP × 100. Statement I: SP = CP + 240. Without knowing CP or SP, the profit % cannot be determined. Statement II: SP = 1.2 × CP → Profit = 0.2 × CP → Profit % = 20%. So statement II alone is sufficient.

Shortcut Techniques

  • Analyze each statement independently first. Do not carry over information from one statement to the other.
  • If a statement gives an equation with one unknown, it is usually sufficient. If it gives one equation with two unknowns, it is usually not sufficient.
  • For 'Yes/No' type questions, a statement is sufficient only if it gives a definite YES or a definite NO.
  • Remember: You don't need to find the exact answer — just determine whether the answer CAN be found.
Pro Tip
In competitive exams, data sufficiency questions are often tricky because statements may seem sufficient but actually aren't. Always check for hidden assumptions. For example, a statement giving a ratio of two ages is not sufficient unless there is another equation to find unique values.

Advanced Problem Types

Competitive exams feature advanced variations combining multiple reasoning concepts. Master these to score high.

Multi-Step Problems

Some questions require applying multiple reasoning techniques sequentially. Break problems into clear steps.

Common Traps

  • Assuming a pattern continues without checking all elements
  • Misinterpreting negative statements in syllogisms
  • Forgetting wrapping in alphabet coding (Z to A transition)
  • Confusing directions (East vs West)
  • Overlooking either-or cases in syllogisms
  • Not considering all possible arrangements in puzzles
Pro Tip
For puzzles, start with the most concrete clue and build around it. Draw diagrams for seating arrangements and family trees for blood relations.

Combining Algebraic and Logical Constraints

Data sufficiency questions frequently blend algebraic equations with logical conditions such as parity, divisibility, or ordering. The key is to treat each statement as a system of constraints and to ask whether the system admits a unique solution for the target quantity. When a statement supplies an equation with two unknowns, it is usually insufficient unless a second independent relation — either from the other statement or from an implicit logical rule — reduces the degrees of freedom to zero. For example, a statement that “x + y = 10” alone cannot determine x, but if the question also tells us that x and y are positive integers and that x is even, the parity condition eliminates all but a few pairs, and the combination may become sufficient. Always list the explicit equations first, then overlay any hidden logical restrictions (integer, positive, prime, distinct, etc.) before judging sufficiency.

A practical workflow: (1) Translate each statement into mathematical notation, marking known constants and variables. (2) Identify the target expression (e.g., “value of x”, “ratio of a to b”). (3) Count independent equations versus unknowns. (4) Add any domain constraints (integers, non‑negative, real). (5) Test whether the target can vary while all constraints hold. If the target is forced to a single value, the data are sufficient; if at least two admissible values exist, they are not. This method prevents the common error of assuming that “two equations, two unknowns” automatically guarantees sufficiency — the equations must be independent and the domain must not introduce extra degrees of freedom.

Consider a question asking for the value of a two‑digit number N. Statement I: “The sum of the digits of N is 9.” Statement II: “N is a multiple of 11.” Alone, each statement leaves multiple candidates (I gives 18, 27, 36, 45, 54, 63, 72, 81, 90; II gives 11, 22, 33, 44, 55, 66, 77, 88, 99). Together they intersect at 99 only, so the combination is sufficient. The logical constraint “two‑digit” and the algebraic constraints “digit sum = 9” and “multiple of 11” together produce a unique answer. This illustrates how logical domain restrictions can turn an otherwise under‑determined algebraic system into a sufficient one.

Data Sufficiency with Inequalities and Absolute Values

Inequalities and absolute‑value expressions introduce ranges rather than single points, which changes the sufficiency analysis dramatically. A statement such as “|x – 3| < 5” translates to –2 < x < 8, a continuous interval. If the question asks “Is x > 0?” this statement alone is insufficient because the interval contains both positive and negative values. However, if a second statement says “x is an integer”, the interval collapses to the set {–1, 0, 1, 2, 3, 4, 5, 6, 7}. The target “x > 0” is still not decided uniquely because both positive and non‑positive integers remain. Only when the combined constraints shrink the feasible set to a subset that lies entirely on one side of the decision boundary does sufficiency arise.

When handling absolute values, split the expression into cases based on the sign of the inner expression. Each case yields a linear inequality; the union of the case solutions forms the overall feasible region. Be careful with “or” versus “and” logic: |x| < a means –a < x < a (an “and” condition), while |x| > a means x < –a or x > a (an “or” condition). The latter creates two disjoint intervals, which often makes a statement insufficient for a yes/no question unless the other statement eliminates one interval entirely.

A typical trap is to treat an inequality like “x² > 9” as equivalent to “x > 3”. The correct translation is x < –3 or x > 3. If the question asks “Is x positive?” the statement alone is insufficient because x could be –4. Adding a second statement “x > 0” would make the combination sufficient, but adding “x is an integer” would still leave both –4 and 4 as possibilities, so insufficiency persists. Always map the inequality to its exact solution set before combining with other data.

Worked Example: Inequality Sufficiency
Question: Is the integer x positive?
Statement I: x² – 4x – 5 < 0
Statement II: x is a multiple of 3
Statement I: Factor the quadratic: (x – 5)(x + 1) < 0. The product is negative between the roots, so –1 < x < 5. Since x is an integer (implied by the question), the possible values are {0, 1, 2, 3, 4}. This set contains both non‑positive (0) and positive (1‑4) integers, so Statement I alone is insufficient.
Statement II: x = 3k for some integer k. This alone gives infinitely many positive and negative multiples, so insufficient.
Combined: Intersect {0,1,2,3,4} with multiples of 3 → {0,3}. The set still contains 0 (non‑positive) and 3 (positive). Therefore the answer cannot be determined uniquely. The correct choice is “Both statements together are not sufficient.”
Exam‑Day Strategy
When you see absolute values or quadratic inequalities, immediately sketch the number line or write the critical points. Mark the feasible intervals with open or closed circles. Then overlay the second statement’s discrete set (e.g., multiples, primes). Visual intersection is faster than algebraic manipulation and reduces sign‑error risk.

Geometric Data Sufficiency: Figures and Measurements

Geometry‑based data sufficiency questions test whether given measurements (lengths, angles, areas, perimeters) determine a unique geometric quantity. The figure may be a triangle, quadrilateral, circle, or a composite shape. A single statement often provides a partial set of constraints — for instance, two sides and a non‑included angle (SSA) — which is notoriously ambiguous because it can yield zero, one, or two possible triangles. Recognizing the congruence criteria (SSS, SAS, ASA, AAS, RHS) is essential: a statement that supplies any one of these complete sets makes the triangle uniquely determined, and any derived measure (area, third side, circumradius) becomes computable.

When statements involve circles, remember that a chord length and its distance from the centre uniquely fix the radius (by the Pythagorean theorem). Conversely, knowing only the radius and a chord length does not fix the chord’s position; the chord could be anywhere at that distance from the centre. Similarly, an inscribed angle theorem tells us that the measure of an inscribed angle is half the measure of its intercepted arc. If a statement gives the arc measure, the angle is fixed; if it gives the angle, the arc is fixed. However, knowing only the radius and an inscribed angle does not determine the chord length unless the central angle is also known.

Composite figures often require adding or subtracting areas. A statement that gives the area of a rectangle and the radius of a semicircle attached to one side may be sufficient for the total area, but insufficient for the perimeter if the rectangle’s other dimension is unknown. Always identify which dimensions are locked by the given data and which remain free variables. Draw a quick schematic, label knowns, and count degrees of freedom. If the target quantity can be expressed solely in terms of locked dimensions, the data are sufficient.

Probability and Statistics in Data Sufficiency

Probability questions in data sufficiency usually ask for a specific probability value (e.g., “What is the probability that a randomly chosen ball is red?”) or a yes/no decision (“Is the probability greater than 0.5?”). A statement may provide the composition of a sample space (counts of each colour) or a relationship between probabilities (e.g., “The probability of red is twice the probability of blue”). The sample space must be fully known — either by absolute counts or by enough ratios plus a total count — to compute a numeric probability. Ratios alone are insufficient unless the total number of outcomes is also given or can be deduced from another statement.

Statistical measures such as mean, median, mode, range, and standard deviation behave similarly. Knowing the mean of a set of five numbers does not determine the median; many distributions share the same mean. However, if a statement says “The five numbers are consecutive integers”, the mean equals the median, and both become determined once the mean is known. When statements give overlapping statistical facts (e.g., “Mean = 10, Median = 10, Range = 4”), check whether the system of equations they imply has a unique solution for the target statistic. Often the combination of mean and range for a symmetric distribution is sufficient, but for an arbitrary set it is not.

Conditional probability adds another layer: a statement like “P(A|B) = 0.3” together with “P(B) = 0.5” yields P(A∩B) = 0.15. If the question asks for P(A), you still need P(A∩Bᶜ) or P(A|Bᶜ) and P(Bᶜ). Always write the probability tree or Venn diagram, list known probabilities, and see whether the unknown target can be expressed solely in terms of knowns. If any required component remains free, the data are insufficient.

Time, Speed, and Distance: Integrated Sufficiency Analysis

Time‑speed‑distance (TSD) problems are a staple of data sufficiency because they translate into linear equations of the form distance = speed × time. A single statement often provides two of the three variables for a single journey, leaving the third unknown. For example, “The train travels 300 km in 5 hours” gives speed = 60 km/h, but if the question asks for the time taken to travel 450 km, the speed is known and the answer is computable — the statement is sufficient. However, if the statement only says “The train’s speed is 20 km/h more than the bus’s speed”, we have one equation with two unknown speeds; the target (e.g., time for the train to cover a given distance) cannot be found without additional data.

Relative motion introduces the concept of effective speed: when two objects move toward each other, their relative speed is the sum; when they move in the same direction, it is the difference. A statement giving the meeting time of two vehicles starting from opposite ends provides the sum of their speeds (total distance ÷ meeting time). If a second statement gives the ratio of their speeds, the individual speeds become solvable, and any downstream question (time for one vehicle to cover the whole distance, distance covered by the other before meeting) becomes answerable. Without the ratio, the individual speeds remain a degree of freedom.

Round‑trip or multi‑segment journeys add equations for each segment. A statement like “The average speed for the whole trip is 48 km/h” together with “The speed on the first half is 40 km/h” allows solving for the speed on the second half (using harmonic mean for equal distances). If the segments are based on time rather than distance, the arithmetic mean applies. Misidentifying the averaging method is a frequent trap. Always clarify whether “half the journey” refers to distance or time before writing equations.

  • Assuming a single equation with two unknowns is sufficient because the numbers look “nice”.
  • Ignoring domain restrictions such as integer, positive, or distinct values that can collapse a solution set.
  • Treating |x| > a as a single interval instead of two disjoint intervals.
  • Confusing SSA with a valid triangle congruence criterion and declaring a triangle uniquely determined.
  • Using arithmetic mean for average speed when the problem defines equal distances, which requires harmonic mean.
  • Overlooking that a probability ratio without a total count leaves the absolute probability undetermined.
  • Always verify that the combined statements do not introduce hidden assumptions.

Data Sufficiency with Sets, Venn Diagrams, and Overlapping Groups

Set‑based data sufficiency questions test whether the information given can uniquely determine the cardinality of a specific region in a Venn diagram. The universal set is often implied (e.g., “all students in a class”) and the statements supply either absolute counts for some regions or relationships such as “the number of students who play cricket is twice the number who play football”. A single statement that provides the total of the universal set together with the sizes of all but one region is sufficient, because the missing region equals the total minus the sum of the known regions. If a statement only gives ratios among overlapping groups (e.g., “the ratio of students who play both cricket and football to those who play only cricket is 3:2”), the absolute numbers remain undetermined unless another statement supplies a concrete total or an additional independent ratio that together fix the scale.

When two statements are combined, check whether they jointly fix every degree of freedom. A common pattern: Statement 1 gives the total number of elements in the universal set; Statement 2 gives the number of elements in the union of two subsets. The intersection can then be derived from the inclusion‑exclusion principle only if the individual subset sizes are also known or can be deduced. If the individual sizes are missing, the intersection remains a free variable and the data are insufficient. Always draw a three‑circle Venn diagram, label each of the seven regions (including the outside region), and write algebraic expressions for the known totals. Count the independent equations; if the number of independent equations equals the number of unknown regions that the question asks about, the data are sufficient.

Be careful with “at least” or “at most” language. A statement such as “At least 30 students play both games” provides an inequality, not an exact value. Unless the question asks for a yes/no answer that can be resolved by the bound (e.g., “Is the number of students who play both games greater than 25?”), the inequality alone rarely yields a unique numeric answer. In such cases, combine the inequality with other exact counts to see whether the feasible range collapses to a single integer.

Data Sufficiency with Functions, Graphs, and Transformations

Function‑based data sufficiency questions often present a relationship such as f(x) = ax² + bx + c and ask for a specific value like f(3) or the vertex coordinates. A statement that supplies three distinct points on the graph determines the three coefficients uniquely, making any subsequent query about the function sufficient. If only two points are given, the quadratic family retains one degree of freedom; the target value will vary across that family unless the question asks for a property common to all members (e.g., the axis of symmetry when the two points are symmetric about it).

Transformations add another layer. A statement like “The graph of g(x) = f(x‑2) + 3 passes through (5, 7)” translates to f(3) = 4. If the question asks for f(0), this single transformed point is insufficient because infinitely many quadratics satisfy f(3)=4. A second statement providing another transformed point or a direct value of f at some argument may close the system. When statements involve derivatives (e.g., “f′(1) = 5”), they contribute linear equations in the coefficients. Count the total independent linear equations; if they equal the number of unknown coefficients, the function is fully determined.

Graphical information such as “the parabola opens upward and its vertex lies on the line y = 2x + 1” supplies a non‑linear constraint (the vertex coordinates satisfy the line equation). Combined with a point on the curve, this often yields a unique quadratic. However, if the vertex line is parallel to the axis of symmetry, the constraint may be redundant. Always convert geometric descriptions into algebraic equations before counting degrees of freedom.

Worked Example: Overlapping Sets
In a survey of 200 people, each person likes at least one of three fruits: apple, banana, cherry. Statement 1: 120 people like apple, 90 like banana, 80 like cherry. Statement 2: 30 people like both apple and banana, 25 like both banana and cherry, 20 like both apple and cherry. Is the number of people who like all three fruits uniquely determined?
Let A, B, C be the sets. From Statement 1 we have |A|=120, |B|=90, |C|=80. From Statement 2 we have |A∩B|=30, |B∩C|=25, |A∩C|=20. The universal total is 200 = |A∪B∪C|. By inclusion‑exclusion, |A∪B∪C| = |A|+|B|+|C| − (|A∩B|+|B∩C|+|A∩C|) + |A∩B∩C|. Substituting known values: 200 = 120+90+80 − (30+25+20) + x → 200 = 290 − 75 + x → 200 = 215 + x → x = −15. A negative intersection is impossible, so the given data are inconsistent; therefore the statements together cannot represent a real survey. In a data‑sufficiency sense, the combination leads to a contradiction, which means the data are not sufficient to determine a valid non‑negative integer for the triple intersection. The correct answer is that the data are insufficient (or the question is flawed).
Exam‑Day Strategy
When a set problem gives totals for each individual set and for each pairwise intersection, immediately write the inclusion‑exclusion formula. If the universal total is also given, you have a single linear equation in the triple intersection. Solve it; if the result is negative or non‑integral, the data are inconsistent and therefore insufficient. This quick check saves time on lengthy Venn‑diagram drawings.

Data Sufficiency with Number Theory: Divisibility, Remainders, and Modular Arithmetic

Number‑theory data sufficiency questions frequently ask for the remainder when an integer N is divided by a given divisor, or whether N satisfies a divisibility condition. A statement such as “N ≡ 3 (mod 7)” fixes N modulo 7 but leaves infinite possibilities for N modulo other numbers. If the question asks for N mod 5, this single congruence is insufficient unless the modulus 5 and 7 are linked by another statement (e.g., “N ≡ 2 (mod 5)”). The Chinese Remainder Theorem guarantees a unique solution modulo the product of coprime moduli when congruences for each modulus are provided. Therefore, two statements giving congruences modulo coprime numbers are jointly sufficient for any target modulus that divides the product.

Divisibility statements like “N is divisible by 12” imply N ≡ 0 (mod 12), which simultaneously gives N ≡ 0 (mod 3) and N ≡ 0 (mod 4). If the question asks whether N is divisible by 6, the single statement is sufficient because 6 divides 12. However, if the question asks whether N is divisible by 8, the statement is insufficient because 8 does not divide 12; N could be 12 (not divisible by 8) or 24 (divisible by 8). Always factor the given divisor and the target divisor to see whether the prime‑power requirements are met.

Remainder problems with unknown dividends often appear as “When N is divided by 9, the remainder is 4. When N is divided by 6, the remainder is 1. What is the remainder when N is divided by 18?” The two statements together form a system of congruences modulo 9 and 6. Since gcd(9,6)=3, the system is consistent only if the remainders agree modulo 3 (4≡1 mod 3, true). The combined modulus is lcm(9,6)=18, so the remainder modulo 18 is uniquely determined. If the question instead asked for the remainder modulo 27, the two statements would be insufficient because 27 is not a divisor of the lcm.

Data Sufficiency with Sequences, Series, and Recurrence Relations

Sequence questions typically provide either an explicit formula (e.g., aₙ = 3n² − 2n + 1) or a recurrence (e.g., aₙ₊₁ = 2aₙ + 1 with a₁ = 3). A single statement giving the explicit formula is sufficient for any term or sum query. A recurrence alone is insufficient unless the initial term(s) are also supplied, because the recurrence defines a family of sequences parameterized by the initial values. If Statement 1 gives the recurrence and Statement 2 gives a₁, the sequence becomes uniquely determined and any downstream question (value of a₁₀, sum of first 20 terms) is answerable.

Arithmetic and geometric progressions are special cases. For an arithmetic progression, knowing any two terms fixes the common difference and the first term, making the whole progression known. For a geometric progression, two terms determine the ratio and the first term provided the terms are non‑zero and the ratio is not ambiguous (e.g., a₂ = 6, a₄ = 54 gives r² = 9 → r = ±3; the sign ambiguity may leave two possible progressions unless an additional condition such as “all terms are positive” is given). Always check for sign or multiple‑root ambiguities.

Series sums often involve formulas that depend on the number of terms n. A statement like “The sum of the first n terms is 210” together with “The nth term is 30” yields two equations in the two unknowns a₁ and d (for an AP) or a₁ and r (for a GP). If the progression type is not stated, the system may have multiple solutions across AP and GP families, rendering the data insufficient. Explicitly identifying the progression type in the statements is therefore crucial.

Data Sufficiency with Optimization: Min‑Max and Extreme Value Analysis

Optimization data sufficiency questions ask whether the given constraints are enough to determine the maximum or minimum possible value of an expression, often under integer or real‑variable conditions. A typical format: “x and y are positive integers satisfying x + y = 20. What is the maximum value of xy?” Statement 1 might give the sum constraint; Statement 2 might give a product constraint or a bound on one variable. If only the sum is known, the product xy is maximized when x and y are as close as possible (10 and 10), giving 100. This is a unique maximum, so the single statement is sufficient. However, if the variables are only required to be real numbers, the same sum yields a continuous range of products up to 100, but the maximum is still 100, so the statement remains sufficient for the maximum value.

When constraints are inequalities (e.g., 2x + 3y ≤ 30, x ≥ 0, y ≥ 0), the feasible region is a polygon. The maximum of a linear objective function occurs at a vertex. A statement that provides the full set of linear inequalities is sufficient because the vertices can be computed. If a statement omits one inequality, the feasible region becomes unbounded or larger, and the maximum may increase or become infinite, making the data insufficient for a finite maximum. Always verify that the number of independent binding constraints equals the number of variables at the optimum.

Integer‑only domains introduce discreteness. The continuous optimum may not be attainable with integers; the true integer optimum could be at a neighboring lattice point. A statement giving only the continuous constraints is insufficient for the integer maximum unless the continuous optimum happens to be integral. A second statement that restricts the variables to integers (or gives a specific integer bound) may be needed. In data sufficiency, treat the integer requirement as an extra constraint that must be explicitly supplied or logically deduced.

  • Assuming a single congruence modulo a composite number determines the remainder modulo each of its factors without checking the factorization.
  • Treating a recurrence relation as sufficient without confirming that all required initial terms are provided.
  • Overlooking sign ambiguity when solving for the common ratio of a geometric progression from two terms.
  • Confusing the continuous maximum of a linear program with the integer maximum when the domain is restricted to integers.
  • Believing that two pairwise intersections and individual set totals always determine the triple intersection, ignoring the universal total requirement.
  • Neglecting to verify consistency of modular equations before applying the Chinese Remainder Theorem.
  • Mastering these traps ensures higher accuracy in data sufficiency.

Practice Questions

← Inequalities Series & Analogy →