CAT Quant · Study & Practice

Set Theory

AreaModern Maths DifficultyModerate CAT weightage1–3 questions (Venn / survey problems; high-frequency in XAT & SNAP)

Set Theory is one of the most reliable scoring areas in CAT Modern Maths, because almost every question reduces to one of two pictures: a two-circle or a three-circle Venn diagram. A set is just a collection of distinct objects, and the language of sets — union (everything in either), intersection (the common part), and complement (everything outside) — lets you count overlapping groups without double-counting. The single most important tool is the inclusion–exclusion principle, n(A∪B) = n(A) + n(B) − n(A∩B), and its three-set cousin. CAT loves the "survey" format: out of 100 students, so many study Maths, so many Physics, so many both, how many study neither? These reward students who fill the Venn regions from the inside out rather than blindly plugging formulas. This chapter builds that fluency: the union–intersection algebra, complement and De Morgan’s laws, and the prized max/min-overlap questions where you must squeeze the largest or smallest possible value of "exactly one" or "all three". Master the region-by-region method and these become quick, certain marks while others fumble with overlapping counts.

Topics

1 Union & Intersection 4 worked · 5 practice · 8-Q test Start → 2 Complement 4 worked · 5 practice · 8-Q test Start → 3 Venn Diagrams (2 and 3 sets) 4 worked · 5 practice · 8-Q test Start →

⚡ CAT shortcuts & speed methods

The fastest ways to crack this chapter under time pressure — the techniques that separate a 95+ percentiler from the rest.

  • Two sets: n(A∪B) = n(A) + n(B) − n(A∩B). If you ever add without subtracting the overlap, you have double-counted.
  • Always fill a 3-circle Venn from the centre outwards: triple first, then "exactly two" = pair − triple, then "only one".
  • Exactly one = Σsingles − 2·Σpairs + 3·triple; exactly two = Σpairs − 3·triple. Memorise the 1, 2, 3 coefficients.
  • "Neither / none" = Total − n(A∪B∪C). Compute the union once and subtract — don’t chase each negative condition.
  • Min(all three) when everyone likes ≥1 of three sets ⇒ at least (Σsingles − 2·Total); if negative, the floor is 0.
  • For two sets, min(both) = n(A) + n(B) − Total (when positive); max(both) = the size of the smaller set.

⚠️ Common mistakes & traps

CAT is designed so that careless errors here cost you marks. Internalise each trap before the exam.

  • Adding n(A) and n(B) and forgetting to subtract n(A∩B) — the overlap gets counted twice.
  • Treating "exactly two" as Σpairs; you must subtract 3·triple because the centre is inside all three pair regions.
  • Confusing "at least two" (Σpairs − 2·triple) with "exactly two" (Σpairs − 3·triple).
  • Forgetting the "neither" group when the universe total exceeds n(A∪B∪C).
  • In max/min problems, ignoring the constraint that every region count must stay ≥ 0.

📈 CAT exam insight & PYQ analysis

Set Theory shows up in CAT mainly through LR-flavoured Venn/survey questions, and far more heavily in XAT, SNAP and IIFT, where a three-set survey with a max/min twist is almost a fixture. The recurring patterns are: find the "neither" region, find "exactly one / exactly two", and the harder "minimum number who like all three" when every person likes at least one option. Difficulty is Moderate — the arithmetic is light but the wording is designed to trip you between "at least", "exactly" and "only". Prioritise the inclusion–exclusion coefficients and the region-by-region fill; that alone clears most questions in under 90 seconds.

🎴 Flashcards — instant recall

Tap a card to reveal the answer. Drill these until they are automatic.

Two-set union formula?Tap to reveal
n(A∪B) = n(A) + n(B) − n(A∩B)
Three-set union formula?Tap to reveal
Σsingles − Σpairs + n(A∩B∩C)
How many like none (3 sets)?Tap to reveal
Total − n(A∪B∪C)
Exactly one (3 sets)?Tap to reveal
Σsingles − 2·Σpairs + 3·triple
Exactly two (3 sets)?Tap to reveal
Σpairs − 3·triple
At least two (3 sets)?Tap to reveal
Σpairs − 2·triple
Complement count n(A')?Tap to reveal
n(U) − n(A)
De Morgan: (A∪B)' = ?Tap to reveal
A' ∩ B'
De Morgan: (A∩B)' = ?Tap to reveal
A' ∪ B'
Number of subsets of an n-element set?Tap to reveal
2ⁿ
Min(both) for two sets over a universe T?Tap to reveal
n(A) + n(B) − T (if positive, else 0)
Max(both) for two sets?Tap to reveal
Size of the smaller set, min(n(A), n(B))

📌 Quick revision

A union collects everything in either set, an intersection keeps only the common part, and inclusion–exclusion stops double-counting: n(A∪B) = n(A) + n(B) − n(A∩B). For three sets, add singles, subtract pairs, add the triple. Complement is n(U) − n(A), and De Morgan flips union to intersection of complements. Solve survey problems by filling a Venn from the centre out: triple, then exactly-two = pair − triple, then only-one. Use "none = Total − union" for neither questions, and the bounds min(both) = n(A)+n(B)−T and max(both) = smaller set for max/min overlap. Keep every region ≥ 0.

Chapter test

📝 Set Theory — Chapter Test
25 fresh questions · timed · full solutions
Start chapter test →
📊 My CAT analytics
Track scores, accuracy by topic and progress over time.
View analytics →

🏆 Vidaara CAT success checklist

You have truly mastered Set Theory when you can tick every box below.

  • Recall every formula in this chapter without looking them up
  • Solve each topic’s practice set with at least 80% accuracy
  • Use the chapter shortcuts to cut your solving time in half
  • Spot and avoid every common trap listed above
  • Score 80%+ on the timed chapter test

📋 Chapter mastery scorecard

Track where you stand. Aim for the target before moving to the next chapter.

Skill checkpointTarget
Concept theory & formulas understood100%
Topic practice sets attempted (3 topics)3/3
Best topic-test score— → 80%+
Chapter test score— → 80%+
Flashcards drilled to instant recall12 cards