Home
Critical & Analytical
500 Practice Questions Available

Data Sufficiency — Condition Evaluation & Problem Solvability

Tests meta-reasoning efficiency. Candidates determine whether a question can be definitively resolved using Statement I alone, Statement II alone, both together, or if data remains insufficient.

Core Skills & Cognitive Modules

Key cognitive competencies and question patterns assessed under Data Sufficiency.

1
2-Statement Condition Isolation

Execute the standard 5-option Data Sufficiency protocol on two statements, maintaining strict cognitive isolation between Statement I and Statement II.

Focus: Sterile evaluation, eliminating information bleed-over, and minimal combination
Universal high frequency in SSC CGL, Bank PO Prelims, RRB NTPC & State PSCs
2
3-Statement Banking Scenarios

Systematically analyze complex multi-statement problems featuring three independent conditions across individual, pairwise, and joint combinations.

Focus: Combinatorial elimination, 3-way Venn reasoning, and matrix verification
Premier high-weightage topic in Bank PO Mains (IBPS/SBI) and RBI Grade B
3
Direction & Ranking Sufficiency

Evaluate sufficiency in spatial coordinate systems, multi-point direction networks, and linear order/ranking interval calculations.

Focus: Overlapping intervals, shortest path determinacy, and boundary condition checks
Core staple in Bank PO, Insurance & Management Entrance (CAT/CMAT)
4
Eliminating Redundant Conditions

Detect when an additional statement provides redundant information that is already captured by a prior sufficient condition.

Focus: Information economy, redundancy detection, and parsimony optimization
Crucial discriminator in advanced GMAT, CAT & SBI PO Mains

Comprehensive Guide: Mastering Data Sufficiency

Theoretical foundations, question formats, and high-scoring exam techniques.

Conceptual Foundations of Data Sufficiency

Data Sufficiency evaluates meta-reasoning, constraint satisfaction, and information determinacy. Rather than calculating answers, candidates must determine whether provided statements contain sufficient mathematical and logical constraints to yield a unique solution without redundancy or unstated assumptions.

The 5-Stage Data Sufficiency Protocol

  1. Analyze the Target Query & Classify Type: Is it a Value Question ('What is the rank of X?') or a Boolean Question ('Is X older than Y?')? Identify what exact information is needed.
  2. Evaluate Statement I in Strict Isolation: Assume Statement I is the only information that exists. Does it yield a unique answer? If yes, note 'I works'. If no, note 'I fails'.
  3. Reset to Zero & Evaluate Statement II in Isolation: Completely wipe Statement I from your memory. Evaluate Statement II alone. Does it yield a unique answer? Note 'II works' or 'II fails'.
  4. Combine Statements Only if Both Failed: If and only if both statements failed independently, combine Statement I and Statement II. Do their combined constraints yield a unique solution?
  5. Map to Standard Option Framework: Map your result to the question's specific 5-option layout (verify whether Option A is I alone, or if options are arranged differently).

Foundational Principles of Data Sufficiency

1. Information Theory & DeterminacyA query represents an unknown state in a probability distribution; sufficient data reduces entropy to exactly zero (unique deterministic state).
Key Rule: Determinacy requires exactly 1 unique valid solution.
2. The Isolation PrincipleEvaluating conditional statements requires sterile independence to avoid false dependency artifacts.
Key Rule: Never carry variables across statement boundaries during single-statement evaluations.
3. The Symmetry of Boolean SufficiencyA definitive negative resolution provides identical information entropy reduction as a definitive affirmative resolution.
Key Rule: Definite Yes = Sufficient; Definite No = Sufficient; 'Maybe / Depends' = Insufficient.
4. The Principle of ParsimonyMinimal sufficient constraints take precedence over redundant super-sets.
Key Rule: Always prefer single-statement sufficiency over combined sufficiency.

High-Frequency Exam Traps & Pitfalls

⚠️ Information Contamination (Bleed-Over)
Carrying a deduction made in Statement I into the evaluation of Statement II, falsely concluding Statement II is sufficient.
✓ Prevention: Mentally wipe the slate clean before reading Statement II; cover Statement I with your hand.
⚠️ The Negative Answer Sufficiency Fallacy
Marking a statement insufficient because the answer to 'Is X the tallest?' turns out to be 'No, Y is taller'.
✓ Prevention: A definitive 'NO' is a complete, 100% sufficient answer.
⚠️ Over-Calculation Time Sink
Spending 90 seconds solving a system of linear equations to find x = 14.5, when merely knowing the determinant is non-zero proves sufficiency in 5 seconds.
✓ Prevention: Never compute the final value; stop as soon as you confirm a unique solution exists.
⚠️ Dual-Value Indeterminacy Oversight
Accepting a statement that gives two possible values (e.g., quadratic equation with roots 2 and 5) as sufficient.
✓ Prevention: Verify that the answer is UNIQUE. Multiple valid answers mean INSUFFICIENT.
Speed Benchmark: Target fast, structured deduction to bank buffer time for complex arrangement and analytical puzzles.
SSC: Low RelevanceRailways: Medium RelevanceBanking: High RelevanceState PSCs: High Relevance

Data Sufficiency Operational Cheat Sheet

Standard decision trees, 5-choice mapping, and common traps.

The 5-Standard Option Decision Tree
Step 1: Test I alone. Step 2: Test II alone. If I alone: Option A. If II alone: Option B. If either alone: Option C. If neither alone, combine: If I+II works: Option D (Together). If I+II fails: Option E (Neither).
Condition: Standard 2-statement format.
Watch out: Testing both together before testing Statement II independently.
The 'Definitive NO' Sufficiency Rule
In Yes/No questions, a statement that proves 'NO, definitely not' is 100% SUFFICIENT. You do not need the answer to be 'Yes'.
Condition: Boolean (Yes/No) queries.
Watch out: Marking a statement insufficient because the answer is negative.
The Clean Slate Isolation Rule
When reading Statement II, mentally ERASE everything from Statement I. Forget all coordinates, values, and relations deduced in Statement I.
Condition: Evaluating Statement II.
Watch out: Carrying a deduction from Statement I into Statement II.
Never Calculate the Final Number Rule
Stop the moment you know that a unique answer EXISTS. Do not waste 40 seconds calculating the exact numerical value.
Condition: Quantitative or numerical sufficiency.
Watch out: Fully solving complex equations when uniqueness is already proven.
Unique Answer Mandate Rule
If a statement produces two possible values (e.g., x = 3 or x = 7), it is INSUFFICIENT. A sufficient condition must yield exactly ONE value.
Condition: Value questions (e.g., 'What is the age of X?').
Watch out: Accepting a statement that narrows the answer down to two candidates.
Redundant Combination Prohibition
If Statement I alone is sufficient, NEVER choose 'Both statements together are needed', even if Statement II confirms the same fact.
Condition: Statement I is self-sufficient.
Watch out: Combining statements when one statement already suffices.

Data Sufficiency Algorithmic Decision Tree & Option Models

Sequential single-statement isolation protocols and canonical 5-option elimination grids.

Model 1: 2-Statement Sequential Decision Tree

START: Read Question StemSTEP 1: Test Statement (1) ALONE(Completely ignore Statement 2!)(1) IS SUFFICIENTAnswer is Option A or C(1) NOT SUFFICIENTEliminate Options A & CSTEP 2: Test Statement (2) ALONE(Completely isolate Statement 2!)STEP 3: Combine (1) + (2) ONLY if neither is sufficient alone!
The Cardinal Rule: Never combine Statement 1 and Statement 2 immediately. Always test Statement 1 alone, then Statement 2 alone.
No Numerical Solving Needed: You do NOT need to calculate the actual final number. You only need to verify if a unique single value exists.
Contradiction Trap: Statements in genuine exam questions will never mathematically contradict each other.

Model 2: Standard 5-Option Elimination Grid

OPTSTMT (1)STMT (2)VERDICT(A)✓ Sufficient✗ Not Suff.1 alone is sufficient(B)✗ Not Suff.✓ Sufficient2 alone is sufficient(C)✓ Sufficient✓ SufficientEITHER 1 alone OR 2 alone(D)✗ Not Suff.✗ Not Suff.NEITHER (even combined!)(E)Combined ✓Together ✓BOTH together necessary
Option C vs Option E: In (C), each statement works by itself without any help; in (E), neither works alone, and they must unite.
Yes/No Sufficiency Standard: For a "Is X > Y?" question, a definitive "NO" is just as SUFFICIENT as a definitive "YES".
Indeterminacy: If a statement allows both YES and NO, it is strictly insufficient.

Modeled Problem Walkthroughs: Data Sufficiency

Step-by-step cognitive deduction showing how to isolate governing rules before timed practice.

4 Modeled Walkthroughs
Exemplar Problem Statement
Question: Among five friends — A, B, C, D, and E — who is the tallest? Statements: I. D is taller than A and C, but shorter than B. II. E is shorter than B, but taller than D. Which of the statements is/are sufficient to answer the question?
AStatements I and II together are sufficient, but neither statement alone is sufficientCorrect Answer
BStatement I alone is sufficient, but Statement II alone is not sufficient
CStatement II alone is sufficient, but Statement I alone is not sufficient
DStatements I and II together are not sufficient
Step-by-Step Cognitive Deduction
Step 1Step 1: Understand the Goal: Determine the unique tallest person among {A, B, C, D, E}.
Step 2Step 2: Evaluate Statement I ALONE in strict isolation:
Step 3- Statement I says: D is taller than A and C, but shorter than B => B > D > {A, C}.
Step 4- What about E? Statement I provides ZERO information about E.
Step 5- E could be taller than B (E > B > D > ...), or E could be shorter than B.
Step 6- Because E's position relative to B is unknown, the tallest could be B or E.
Step 7- Statement I ALONE is NOT sufficient.
Step 8Step 3: Evaluate Statement II ALONE in strict isolation (Wipe Statement I clean):
Step 9- Statement II says: E is shorter than B, but taller than D => B > E > D.
Step 10- What about A and C? Statement II provides ZERO information about A and C.
Step 11- Could A or C be taller than B? Yes, we have no constraint preventing A > B.
Step 12- Statement II ALONE is NOT sufficient.
Step 13Step 4: Combine Statement I and Statement II:
Step 14- From Statement I: B > D, and D > A, D > C.
Step 15- From Statement II: B > E > D.
Step 16- Combining them into a single coherent ordering:
Step 17B > E > D > {A, C}.
Step 18- In this combined ordering, B is taller than E, B is taller than D, and D is taller than both A and C.
Step 19- Thus, B is definitively and uniquely taller than all four others (E, D, A, C).
Step 20- We have obtained an unambiguous, unique answer: B is the tallest.
Step 21Step 5: Statements I and II together are sufficient, but neither statement alone is sufficient.
Decisive Deduction Factor:Statement I omits E; Statement II omits A and C. Combining both establishes B > E > D > {A, C}, proving uniquely that B is the tallest.
Statements I and II together are sufficient, but neither statement alone is sufficient (Option A)
Exam Insight: When individual statements leave different entities unconstrained, combine them to test if a complete partial order emerges.

Featured Practice Set (10 Balanced MCQs)

Work through these representative solved questions covering diverse difficulty tiers and cognitive patterns. Select an option to test your deduction with instant feedback and pedagogical explanations.

10 Curated Questions
Question 1easy
2-Statement Condition Isolation

Is the positive integer n divisible by 12? Statement I: n is divisible by both 3 and 4. Statement II: n is divisible by 6.

Question 2easy
2-Statement Condition Isolation

What is the total cost of 1 pen and 1 notebook? Statement I: The total cost of 3 pens and 2 notebooks is $19. Statement II: The total cost of 4 pens and 4 notebooks is $28.

Question 3easy
2-Statement Condition Isolation

Five colleagues—Aarav, Bhavna, Chetan, Divya, and Esha—are seated in a single row of five chairs facing North. Who sits in the exact middle (seat 3)? Statement I: Divya sits at the extreme right end (seat 5), and Chetan sits second to the right of Aarav. Statement II: Bhavna sits at the extreme left end (seat 1), and Esha sits to the immediate right of Aarav.

Question 4medium
2-Statement Condition Isolation

What was the principal sum deposited in a savings bond where interest is compounded annually at a constant rate? Statement I: The compound interest accrued during the 1st year was Rs. 2,000, and the compound interest accrued during the 2nd year was Rs. 2,200. Statement II: The total compound interest accrued over the first 3 years was Rs. 6,620.

Question 5medium
2-Statement Condition Isolation

What was the initial volume of pure alcohol in a laboratory flask containing an alcohol-water solution? Statement I: The initial concentration of alcohol in the solution was 60% by volume. Statement II: When 20 liters of pure water was added to the flask without removing any liquid, the concentration of alcohol dropped from 60% to 40%.

Question 6medium
2-Statement Condition Isolation

Six professionals—M, N, O, P, Q, and R—are seated in a row of six chairs numbered 1 to 6 from left to right, all facing North. Who sits third to the right of M? Statement I: M sits at chair 1, and O sits second to the right of M. Statement II: P sits at chair 4, and R sits at chair 6.

Question 7medium
2-Statement Condition Isolation

Is the integer (2^n - 1) divisible by 7, where n is a positive integer? Statement I: n is an even positive integer. Statement II: n is a positive multiple of 4.

Question 8hard
2-Statement Condition Isolation

Are real numbers x and y such that x is strictly greater than y? Statement I: x^3 - y^3 > 0 and x^2 + xy + y^2 > 0. Statement II: x^2 > y^2.

Question 9hard
2-Statement Condition Isolation

Is the positive integer N a perfect square? Statement I: N has an odd number of distinct prime factors. Statement II: N has an odd number of total positive divisors.

Question 10hard
2-Statement Condition Isolation

Eight people numbered 1 to 8 in clockwise order around a circular table each face either inward or outward. Does person G face inward? Statement I: Person G occupies seat 4, and exactly four people around the table face inward. Statement II: The people occupying even-numbered seats all face in the same direction, and the person at seat 2 faces outward.

Ready to practice all 500 questions?Configure customizable practice drills by difficulty or test your pacing with a timed mock test.

Frequently Asked Questions & Preparation Strategy

Never calculate the final answer! Data Sufficiency tests whether a unique answer CAN be found, not what the numerical or descriptive answer is. The moment you determine that a statement provides enough constraints to yield exactly one solution, stop and mark it sufficient.