**CAT DILR: Set Theory & Venn-Based Reasoning – The 99%ile Study Guide**

CAT DILR: Set Theory & Venn-Based Reasoning – The 99%ile Study Guide

What This Is

Set Theory and Venn-based reasoning appear in ~2-3 questions per CAT DILR section, often disguised as: - Logical puzzles (e.g., "30 students play cricket, 20 play football…") - Data sufficiency (e.g., "Is statement 1 alone sufficient to find the number of students who play both sports?") - Caselet-based DI (e.g., a table of survey responses with overlapping categories)

Why master it?
- High ROI: These questions are formula-light but logic-heavy—if you know the framework, you solve them in <2 minutes.
- Percentile booster: Missing even 1 such question can drop you from 99.5%ile to 98%ile in DILR.
- Real CAT example:

"In a class of 100 students, 60 play cricket, 50 play football, and 20 play neither. How many play both?" (Answer: 30. But CAT will twist it with 3+ sets, partial data, or "only" conditions.)

Key Concepts & Techniques

1. The 2-Set Formula (Must-Know)
2. Formula: n(A ∪ B) = n(A) + n(B) – n(A ∩ B)
3. When to use: When you have total, neither, and two sets (e.g., cricket + football).

4. Pro tip: If "neither" is given, subtract it from the total first to get n(A ∪ B).

5. The 3-Set Formula (Advanced)

6. Formula:
   n(A ∪ B ∪ C) = n(A) + n(B) + n(C) – n(A ∩ B) – n(B ∩ C) – n(C ∩ A) + n(A ∩ B ∩ C)
7. When to use: For 3+ overlapping sets (e.g., cricket, football, hockey).

8. Shortcut: Draw a 3-circle Venn diagram and fill from the center out (start with A ∩ B ∩ C).

9. "Only" Regions (Critical for CAT)

10. What it means:
    • Only A = A – (A ∩ B) – (A ∩ C) + (A ∩ B ∩ C)
    • CAT loves asking: "How many play only cricket?"

11. When to use: When the question specifies "only" or "exactly" (e.g., "only cricket, not football").

12. Max/Min Overlap (Trap Alert!)

13. Max overlap: To maximize A ∩ B, minimize n(A ∪ B) (i.e., set n(A ∪ B) = max(n(A), n(B))).
14. Min overlap: To minimize A ∩ B, maximize n(A ∪ B) (i.e., set n(A ∪ B) = n(A) + n(B)).

15. When to use: When the question asks for "maximum/minimum possible" values (e.g., "What is the minimum number of students who play both?").

16. Data Sufficiency (DS) Tricks

17. Rule 1: If total + neither is given, you can find n(A ∪ B).
18. Rule 2: If two overlaps are given (e.g., A ∩ B and B ∩ C), you can find the third (A ∩ C) only if n(A ∩ B ∩ C) is known.

19. When to use: For DS questions like "Is statement 1 alone sufficient to find the number of students who play both cricket and football?"

20. Complement Sets (Hidden in CAT)

21. What it means: n(A') = Total – n(A) (e.g., "students who do not play cricket").

22. When to use: When the question gives "not" conditions (e.g., "40 students do not play football").

23. Venn Diagram Shortcuts

24. Labeling: Always label only A, only B, only C, A ∩ B, B ∩ C, C ∩ A, A ∩ B ∩ C, and neither.
25. Filling order:
    1. Start with the triple intersection (A ∩ B ∩ C).
    2. Fill pairwise intersections (A ∩ B, B ∩ C, etc.).
    3. Fill only regions (Only A, Only B, etc.).
    4. Finally, fill neither.

Step-by-Step Strategy (Follow This Every Time)

Step 1: Identify the Total and "Neither"

• Action: Write down:
• Total number of elements (e.g., total students = 100).
• Number of elements in "neither" (e.g., 20 play neither cricket nor football).
• Why? This gives n(A ∪ B) = Total – Neither.

Step 2: List All Given Data

• Action: Extract all numbers from the question:
• n(A), n(B), n(C) (e.g., cricket = 60, football = 50).
• Overlaps: n(A ∩ B), n(B ∩ C), etc.
• "Only" conditions: Only A, Only B, etc.
• Pro tip: If data is missing (e.g., n(A ∩ B) is not given), assume a variable (e.g., let x = n(A ∩ B)).

Step 3: Draw the Venn Diagram (Even for 2 Sets!)

• Action:
• For 2 sets: Draw 2 overlapping circles. Label:
  • Only A, Only B, A ∩ B, Neither.
• For 3 sets: Draw 3 overlapping circles. Label all 8 regions.
• Why? Visualizing prevents mistakes in overlapping regions.

Step 4: Fill the Venn Diagram (Center → Out)

• Action:
• Start with the innermost region (A ∩ B ∩ C for 3 sets).
• Fill pairwise intersections (A ∩ B, B ∩ C, etc.).
• Fill only regions (Only A, Only B, etc.).
• Verify with the total formula.
• Example for 2 sets:
• Given: n(A) = 60, n(B) = 50, n(A ∪ B) = 80 (from Step 1).
• Use n(A ∪ B) = n(A) + n(B) – n(A ∩ B) → 80 = 60 + 50 – x → x = 30.

Step 5: Answer the Question

• Action:
• If the question asks for "only A", read it directly from the Venn.
• If it asks for "A ∪ B", use the formula or sum all regions except "neither".
• If it’s a DS question, check if the given data is sufficient.

Step 6: Cross-Check with Answer Choices (MCQ Only)

• Action:
• Plug your answer into the options.
• If stuck, eliminate impossible options (e.g., overlaps cannot exceed individual sets).

Fully Worked CAT-Style Example

Question: In a survey of 200 people: - 120 like tea, 80 like coffee, 30 like neither.
- 40 like both tea and coffee.
- 20 like tea, coffee, and milk.
- 50 like milk but not tea or coffee.
How many people like only tea?

Step 1: Identify Total and Neither

• Total = 200
• Neither (like none) = 30
• So, n(Tea ∪ Coffee ∪ Milk) = 200 – 30 = 170

Step 2: List All Given Data

• n(Tea) = 120
• n(Coffee) = 80
• n(Tea ∩ Coffee) = 40
• n(Tea ∩ Coffee ∩ Milk) = 20
• Only Milk = 50

Step 3: Draw the Venn Diagram

• Draw 3 circles: Tea (T), Coffee (C), Milk (M).
• Label all 8 regions.

Step 4: Fill the Venn (Center → Out)

1. Innermost region: T ∩ C ∩ M = 20
2. Pairwise intersections:
3. T ∩ C = 40 (given), but this includes T ∩ C ∩ M = 20.
4. So, Only T ∩ C = 40 – 20 = 20.
5. Only regions:
6. Only M = 50 (given).
7. Let Only T = x, Only C = y.
8. Total formula:
   n(T ∪ C ∪ M) = Only T + Only C + Only M + Only T∩C + Only T∩M + Only C∩M + T∩C∩M
170 = x + y + 50 + 20 + (Only T∩M) + (Only C∩M) + 20
   But we don’t have Only T∩M or Only C∩M. Alternative approach:
9. n(T) = Only T + Only T∩C + Only T∩M + T∩C∩M = 120
   → x + 20 + Only T∩M + 20 = 120 → x + Only T∩M = 80
10. n(C) = Only C + Only T∩C + Only C∩M + T∩C∩M = 80
    → y + 20 + Only C∩M + 20 = 80 → y + Only C∩M = 40
11. Now, plug into the total formula:
    170 = x + y + 50 + 20 + Only T∩M + Only C∩M + 20
170 = (x + Only T∩M) + (y + Only C∩M) + 90
170 = 80 + 40 + 90 → 170 = 210 (This doesn’t add up!)
    Mistake spotted! The question doesn’t give n(Milk). Let’s assume n(M) = Only M + Only T∩M + Only C∩M + T∩C∩M.
    But we don’t need n(M) to find Only T. From x + Only T∩M = 80, and since Only T∩M cannot be negative, the minimum x is 0 and maximum x is 80.
    But the question asks for only tea, which is x. We need more data—but wait, the question gives n(Tea ∩ Coffee) = 40 and n(Tea ∩ Coffee ∩ Milk) = 20, so Only T ∩ C = 20.
    Now, n(Tea) = Only T + Only T∩C + Only T∩M + T∩C∩M = 120
    → x + 20 + Only T∩M + 20 = 120 → x + Only T∩M = 80.
    Since Only T∩M is not given, we cannot find x uniquely. But the question implies Only T∩M = 0 (no other info), so x = 80.

Answer: 80 people like only tea.

(Note: This is a tricky question. CAT may not give all data explicitly—look for hidden assumptions!)

Common Mistakes

1. Mistake: Ignoring "neither" and using the total directly.
2. Why it happens: Students forget to subtract "neither" from the total to get n(A ∪ B).

3. Correct approach: Always compute n(A ∪ B) = Total – Neither first.

4. Mistake: Misinterpreting "only" vs. "both".

5. Why it happens: Confusing A ∩ B (both) with Only A (A but not B).

6. Correct approach: Label Venn regions clearly. Only A = A – (A ∩ B) – (A ∩ C) + (A ∩ B ∩ C).

7. Mistake: Assuming all regions are given.

8. Why it happens: CAT often omits data (e.g., doesn’t give n(A ∩ B ∩ C)).

9. Correct approach: Assign variables (e.g., let x = n(A ∩ B ∩ C)) and solve.

10. Mistake: Overcomplicating 2-set problems.

11. Why it happens: Using the 3-set formula for 2 sets.

12. Correct approach: Stick to n(A ∪ B) = n(A) + n(B) – n(A ∩ B) for 2 sets.

13. Mistake: Forgetting to cross-check with answer choices.

14. Why it happens: Solving blindly without verifying.
15. Correct approach: Plug your answer into the options to catch calculation errors.

CAT Traps & Time Management

Traps

1. "Only" vs. "Both" Confusion
2. Trap: CAT asks for "only A" but gives data for A ∩ B.

3. Avoid: Label Venn regions before solving.

4. Partial Data in DS Questions

5. Trap: Statement 1 gives n(A) and n(B), but not n(A ∪ B) or n(A ∩ B).

6. Avoid: Remember: n(A ∪ B) is needed to find n(A ∩ B).

7. Max/Min Questions

8. Trap: Asking for "maximum possible overlap" but not specifying constraints.

9. Avoid: Use n(A ∪ B) ≤ Total and n(A ∩ B) ≤ min(n(A), n(B)).

10. Hidden "Neither"

11. Trap: "Neither" is not explicitly given but can be inferred (e.g., "all students play at least one sport").
12. Avoid: Assume Neither = 0 only if the question says "all" or "everyone".

Time Management

• 2-set problems: 1–1.5 minutes.
• 3-set problems: 2–2.5 minutes.
• DS questions: 1 minute (decide sufficiency quickly).
• Max/Min questions: 1.5 minutes (use shortcuts, don’t over-solve).

Quick Practice

Question 1: In a class of 50 students: - 30 play cricket, 20 play football, 10 play neither.
How many play both cricket and football? Answer: 10.
Solution: n(C ∪ F) = 50 – 10 = 40. n(C ∩ F) = 30 + 20 – 40 = 10.

Question 2: In a survey, 60% like tea, 50% like coffee, and 30% like both. What % like only tea? Answer: 30%.
Solution: Only Tea = n(Tea) – n(Tea ∩ Coffee) = 60% – 30% = 30%.

Last-Minute Cram Sheet (10 One-Liners)

1. 2-set formula: n(A ∪ B) = n(A) + n(B) – n(A ∩ B).
2. 3-set formula: n(A ∪ B ∪ C) = n(A) + n(B) + n(C) – n(A∩B) – n(B∩C) – n(C∩A) + n(A∩B∩C).
3. Only A: A – (A∩B) – (A∩C) + (A∩B∩C).
4. Max overlap: n(A ∩ B) ≤ min(n(A), n(B)).
5. Min overlap: n(A ∩ B) ≥ n(A) + n(B) – Total.
6. Neither: n(A ∪ B) = Total – Neither.
7. DS sufficiency: Need n(A ∪ B) to find n(A ∩ B).
8. Venn filling order: Center → pairwise → only → neither.
9. Trap: "Only A" ≠ "A". Label regions carefully!
10. Time: 2 sets = 1 min, 3 sets = 2 min. Don’t over-solve!

Final Tip: Practice 10–15 Venn questions under timed conditions. CAT tests speed + accuracy, not just formulas. Master the step-by-step strategy, and you’ll solve these in your sleep. ?