GMAT (Graduate Management Admission Test) Data Insights: Data Sufficiency & Quantitative Integration Syllabus

Data Insights: Data Sufficiency & Quantitative Integration syllabus — full chapter and topic list

Expand any chapter to see its topics and sub-topics. This is the whole examinable outline for Data Insights: Data Sufficiency & Quantitative Integration in GMAT (Graduate Management Admission Test), not a summary of it.

1. 1

   Data Sufficiency Fundamentals

   4 topics

   • The five fixed answer choices and decision framework
   • Evaluating statements independently first
   • Combining statements only when needed
   • Value vs yes/no question types
     • Single-value sufficiency
     • Definite yes or definite no
2. 2

   Data Sufficiency Traps & Techniques

   4 topics

   • Avoiding unwarranted assumptions
   • Testing cases and picking smart numbers
   • The C-trap (assuming both statements are needed)
   • Recognizing redundant or restated statements
3. 3

   Quantitative Concepts in Data Sufficiency

   4 topics

   • Number properties in sufficiency form
   • Algebra and equation-counting for solvability
   • Statistics and ratio sufficiency
   • Geometry-flavored sufficiency reasoning

Data Insights: Data Sufficiency & Quantitative Integration flashcards for GMAT (Graduate Management Admission Test)

22 of 51 cards from the Data Insights: Data Sufficiency & Quantitative Integration deck — real questions with worked answers.

1. What are the five fixed answer choices in a GMAT Data Sufficiency problem?

   A: Statement (1) alone is sufficient, but (2) alone is not. B: Statement (2) alone is sufficient, but (1) alone is not. C: Both statements TOGETHER are sufficient, but NEITHER alone is. D: EACH statement ALONE is sufficient. E: The two statements TOGETHER are still NOT sufficient.

2. In Data Sufficiency, what does it mean for a statement to be 'sufficient'?

   It provides enough information to answer the question definitively and uniquely — a single value for a value question, or a consistent yes/no for a yes/no question. You never need to actually find the answer, only confirm one exists.

3. What is the standard step-by-step decision framework (AD/BCE grid) for solving a DS problem?

   1) Evaluate Statement (1) alone. If sufficient, answer is A or D; if not, B, C, or E. 2) Evaluate Statement (2) alone, never carrying over info from (1). 3) If only one is sufficient, pick A or B. If both alone are sufficient, pick D. 4) If neither alone works, combine them: sufficient = C, not sufficient = E.

4. Why must you evaluate each DS statement independently before combining them?

   Because answers A, B, and D depend on a statement being sufficient ON ITS OWN. Letting information from one statement leak into your evaluation of the other corrupts the analysis and leads to wrong choices (often falsely picking C).

5. After analyzing Statement (1) and Statement (2) separately, when are you allowed to combine them?

   Only when NEITHER statement is sufficient alone. If either is sufficient alone, the answer is A, B, or D and you must NOT combine — combining is irrelevant once a single statement already suffices.

6. What is the difference between a 'value' question and a 'yes/no' question in Data Sufficiency?

   A value question asks for a specific quantity (e.g., 'What is x?') and is sufficient only if it yields ONE unique value. A yes/no question asks whether something is true (e.g., 'Is x > 0?') and is sufficient if it gives a definite, consistent 'always yes' OR 'always no'.

7. In a DS yes/no question, is a statement that always produces 'no' considered sufficient?

   Yes. A definitive 'always no' is just as sufficient as a definitive 'always yes.' Sufficiency means the answer is consistent and certain — only a 'sometimes yes, sometimes no' result is insufficient.

8. In a DS value question, why is finding two different possible values fatal to sufficiency?

   Because a value question requires a single, unique answer. If a statement allows two or more distinct values, it cannot pin down the answer, so it is insufficient regardless of how much it narrows things down.

9. What is the 'C-trap' in Data Sufficiency?

   The trap of choosing C (both statements together) because the combined information feels complete and reassuring, when in fact one statement alone was already sufficient (answer A, B, or D) or even together they are insufficient (E). It exploits the urge to use all given data.

10. What habit best protects you from falling into the C-trap?

    Rigorously testing each statement ALONE to full sufficiency before ever combining, and being suspicious whenever combining 'just barely' makes the problem solvable — that ease is often a sign one statement alone already worked.

11. What is an 'unwarranted assumption' in Data Sufficiency, and give a common example?

    Information you wrongly take as given that the problem never states. Common examples: assuming a variable is a positive integer, assuming numbers are distinct, assuming a value is non-zero, or assuming a figure is drawn to scale.

12. In DS, can you assume variables represent integers unless told otherwise?

    No. Unless the problem explicitly states 'integer' (or context like 'number of people' forces it), variables may be fractions, decimals, negatives, or zero. Assuming integers is a classic sufficiency error.

13. What does 'testing cases' (picking numbers) mean as a DS strategy, and what is its goal?

    Plugging in specific allowed values that satisfy a statement to see if you can get more than one answer. The goal is to find two cases that give DIFFERENT answers — if you can, the statement is INSUFFICIENT; if you genuinely cannot, it is likely sufficient.

14. When testing cases to prove insufficiency, which 'smart numbers' should you deliberately try?

    Boundary and edge values: 0, 1, negatives, fractions between 0 and 1, the largest/smallest allowed, and both odd and even. These expose hidden possibilities that 'nice' positive integers hide.

15. What is the logical asymmetry between proving sufficiency and proving insufficiency by testing cases?

    To prove INSUFFICIENCY you need just ONE counterexample (two cases with different answers). To prove SUFFICIENCY you must show NO counterexample exists — testing alone can't fully prove it, so confirm via reasoning, not just a few lucky cases.

16. What is a 'redundant' or 'restated' statement in Data Sufficiency?

    A statement that, after algebraic simplification, conveys the same information as the other statement or as the question stem itself — adding nothing new. Recognizing this often signals the answer is D, A, B, or E (never C), since combining identical info changes nothing.

17. If Statement (2) simplifies to exactly the same equation as Statement (1), what answer choices are impossible?

    C is impossible. If they carry identical information, combining adds nothing, so the answer must be D (if that info suffices alone) or E (if it doesn't). They cannot 'help each other.'

18. In number-property DS, what is the key fact about the product of consecutive integers?

    The product of any k consecutive integers is divisible by k! (k factorial). For example, the product of 2 consecutive integers is even; the product of 3 consecutive integers is divisible by 6.

19. For DS divisibility: if you know x is divisible by 6 and by 4, what is the strongest conclusion about divisibility?

    x is divisible by the least common multiple of 6 and 4, which is 12 — NOT necessarily by 24. Multiplying the divisors overstates the guaranteed divisibility; use the LCM.

20. In number-property sufficiency, what rules govern odd/even results of sums and products?

    Sum: odd+odd=even, even+even=even, odd+even=odd. Product: a product is even if AT LEAST one factor is even; a product is odd only if ALL factors are odd. These often resolve yes/no parity questions.

21. How many distinct linear equations are generally needed to solve for n unknowns, and why does this matter in DS?

    Generally n independent (non-redundant, non-contradictory) linear equations for n unknowns. In DS you count distinct equations against unknowns to judge whether a unique solution — hence sufficiency — exists.

22. In DS, does having two equations in two variables always guarantee a unique solution?

    No. The equations must be INDEPENDENT (not multiples of each other) and CONSISTENT. Two equations that are the same line give infinitely many solutions; parallel lines give none. Also, nonlinear systems can have multiple solutions.

See more Data Insights: Data Sufficiency & Quantitative Integration flashcards →

Planning Data Insights: Data Sufficiency & Quantitative Integration for GMAT (Graduate Management Admission Test)

Data Insights: Data Sufficiency & Quantitative Integration (GMAT (Graduate Management Admission Test)) FAQ