A set is simply a well-defined collection of distinct objects. Well-defined means there is no ambiguity — every object either belongs to the collection or it does not. "The set of even numbers between 1 and 10" is well-defined. "The set of tall students in a class" is not.
Here is the analogy that makes set operations stick in the exam hall: think of two circles drawn on a piece of paper, one labelled A and one labelled B, overlapping in the middle. That overlap is the intersection A ∩ B. The total area covered by both circles is the union A ∪ B. The part of circle A that does not touch circle B is the set difference A − B. The region outside both circles (but inside the rectangle representing the universal set) is the complement.
That mental picture — two overlapping circles inside a rectangle — is the Venn diagram, and you should be able to draw it in under five seconds. Almost every NDA set-theory question is a disguised version of "which region of the Venn diagram are we talking about?"
What makes NDA questions tricky is not individual definitions but nested expressions — something like ((A ∩ B) ∪ (A − B)) − ((A ∩ B) ∪ (B − A)). These look intimidating, but every such expression simplifies to one of the familiar regions: A, B, A ∩ B, A ∪ B, A − B, B − A, or the null set φ. Your job is to reduce the expression step by step, using a small set of identities you will have memorised.
One more important mental model: the partition of A ∪ B. Every element of A ∪ B falls into exactly one of three non-overlapping buckets:
A − BB − AA ∩ BThese three buckets together give you back A ∪ B. Write this down and memorise it. It demolishes the 2024 PYQ instantly, as you will see below.
| Symbol | Name | Meaning |
|---|---|---|
| A ∪ B | Union | All elements in A or B or both |
| A ∩ B | Intersection | Elements in both A and B |
| A − B | Set difference | Elements in A but not in B |
| A' or Aᶜ | Complement | Elements in universal set U but not in A |
| A ⊆ B | Subset | Every element of A is also in B |
| P(A) | Power set | Collection of all subsets of A |
If |A| denotes the number of elements in A, then |P(A)| = 2^|A|. A set with 3 elements has 2³ = 8 subsets.
Label the Venn diagram regions:
Region 1: Only in A = A − B
Region 2: Only in B = B − A
Region 3: In both A and B = A ∩ B
Region 4: Outside both = (A ∪ B)'
Key identity from this: A = (A − B) ∪ (A ∩ B) and B = (B − A) ∪ (A ∩ B).
These two lines are the engine behind most NDA simplification problems.
Absorption / Simplification:
(A ∩ B) ∪ (A − B) = A(A ∩ B) ∪ (B − A) = BA − B ⊆ A, so (A − B) ∪ A = ADe Morgan's Laws:
(A ∪ B)' = A' ∩ B'(A ∩ B)' = A' ∪ B'Commutativity and Associativity work for both ∪ and ∩.
Distributivity:
A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C)A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C)Idempotent: A ∪ A = A, A ∩ A = A
Identity: A ∪ φ = A, A ∩ U = A
Complement: A ∪ A' = U, A ∩ A' = φ
(A − B) ∪ (B − A) ∪ (A ∩ B) = A ∪ B
This says: break A ∪ B into its three non-overlapping pieces and you get it back. So (A ∪ B) − [(A − B) ∪ (B − A) ∪ (A ∩ B)] = φ. This exact structure appeared in the 2024 PYQ.
When you see the condition A ∪ C = B ∪ C paired with A ∩ C = φ and B ∩ C = φ, here is the clean reasoning path:
Any element x ∈ A satisfies x ∉ C (since A ∩ C = φ). Because A ⊆ A ∪ C = B ∪ C, we have x ∈ B ∪ C. Since x ∉ C, it must be that x ∈ B. So every element of A is in B, giving A ⊆ B. By symmetric argument (using B ∩ C = φ), B ⊆ A. Therefore A = B.
Notice that C can be anything disjoint from A and B — it need not be empty. This is a classic NDA trap (Statement I in the 2026 PYQ).
For two sets: |A ∪ B| = |A| + |B| − |A ∩ B|
For three sets:
|A ∪ B ∪ C| = |A| + |B| + |C| − |A ∩ B| − |B ∩ C| − |A ∩ C| + |A ∩ B ∩ C|
This formula appears in word problems ("In a group of 100 students, 60 like cricket, 50 like football, 30 like both. How many like at least one?"). It is also tested indirectly through Venn diagram region counting.
Whenever you see (A ∩ B) ∪ (A − B), immediately write = A. Whenever you see (A ∩ B) ∪ (B − A), immediately write = B. These are the two absorption identities. The proof: the union of "elements in both" and "elements only in A" is exactly all elements in A. Memorise this as a single visual snapshot of the Venn diagram.
Standard approach (distributing and checking each case): ~40 seconds. Using this pattern recognition: ~5 seconds. The 2026 NDA question is solved in two lines once you know these.
Anytime you see the expression (A − B) ∪ (B − A) ∪ (A ∩ B), replace it immediately with A ∪ B. The three buckets — only-A, only-B, both — tile the union perfectly with no overlap and no gap. So any time you subtract this expression from A ∪ B, the result is φ.
Step count for standard method: draw all regions, check each element — roughly 6 steps. Using the three-bucket identity: 1 substitution, 1 subtraction. The 2024 NDA PYQ reduces to (A ∪ B) − (A ∪ B) = φ in one line.
When a question gives you A ∪ C = B ∪ C plus information about intersections, do not try to enumerate elements. Instead use the squeeze: take an arbitrary element of A, trace it through both conditions, and show it must land in B. This directional-element argument proves A = B in under 45 seconds and works regardless of what C is (even C = φ). It also immediately kills Statement I (C must be empty) and Statement III in the 2026 PYQ — both are false counterexamples.
Checking all three statements by trial-and-error with specific sets: ~2 minutes. The squeeze argument: ~45 seconds.
For any expression more than two operations deep, label Venn diagram regions with numbers: 1 = only A, 2 = only B, 3 = A ∩ B, 4 = outside both. Then translate the expression: A = {1, 3}, B = {2, 3}, A − B = {1}, B − A = {2}, A ∩ B = {3}, A ∪ B = {1, 2, 3}. Evaluate the nested expression by tracking which numbered regions survive each operation.
For a three-layer nested expression: standard algebraic manipulation ~3 minutes with risk of error. Region-tracking: ~60 seconds with near-zero error rate.
When a question involves complements of unions or intersections, apply De Morgan and check whether the resulting expression simplifies. (A ∪ B)' = A' ∩ B' (the complement of "at least one" is "neither"). (A ∩ B)' = A' ∪ B' (the complement of "both" is "at least one missing"). A useful memory hook: the complement flips the operation from ∪ to ∩ and vice versa.
Without De Morgan: requires full Venn diagram enumeration. With De Morgan: direct algebraic substitution, cutting solution time by roughly half.
Read the expression. Is it a simplification problem or a logical-statement problem?
If simplification: Identify whether any sub-expression matches one of the two absorbers — (A ∩ B) ∪ (A − B) = A or (A ∩ B) ∪ (B − A) = B. Apply them first. Then check if the remaining expression matches the three-bucket pattern. If still not done, switch to region labelling: assign numbers 1, 2, 3, 4 to Venn diagram zones and track which regions survive.
If logical statements (true/false about sets): For each statement, try to either prove it using the element-tracing squeeze argument or construct a counterexample using simple concrete sets such as A = {1}, B = {2}, C = {3}. A counterexample only needs one instance to kill a statement.
If counting (inclusion-exclusion): Write the formula immediately. Plug in. Do not draw elaborate diagrams unless the question has three sets and three pairwise intersections.
Decision rule: If the expression has more than two operations, always use region labelling. It takes 15 seconds to set up and prevents sign errors that cost you the mark.
Why this question: This is the prototypical NDA set-simplification question — a three-layer nested expression that looks frightening but collapses in two lines using the absorber identities.
Solving path:
Step 1: Recognise (A ∩ B) ∪ (A − B) = A (absorber identity 1).
Step 2: Recognise (A ∩ B) ∪ (B − A) = B (absorber identity 2).
Step 3: The expression becomes (A − B) ∪ A.
Step 4: Since A − B ⊆ A, the union (A − B) ∪ A = A.
Answer: A.
Why this question: This tests whether you can distinguish between what is necessarily true and what is merely possible. Statement I (C = φ) is the trap that catches candidates who think "disjoint from both means empty."
Solving path:
Step 1: Use the squeeze argument. Take any x ∈ A. Since A ∩ C = φ, we know x ∉ C. Since A ∪ C = B ∪ C and x ∈ A ⊆ A ∪ C, we have x ∈ B ∪ C. Since x ∉ C, we get x ∈ B. So A ⊆ B.
Step 2: Symmetric argument with B ∩ C = φ gives B ⊆ A. Therefore A = B. Statement II is true.
Step 3: Kill Statement I with a counterexample. Let A = B = {1}, C = {2}. Then A ∩ C = φ, B ∩ C = φ, A ∪ C = B ∪ C = \{1, 2\}. All conditions hold, yet C = {2} ≠ φ. So Statement I is not necessarily true.
Step 4: Kill Statement III. In the same example, A ∪ B = {1} ≠ {2} = C.
Answer: II only.
Why this question: This is the cleanest application of the three-bucket decomposition. It appeared in 2024 and is a one-line problem if you know the partition identity.
Solving path:
Step 1: Recognise that (A − B) ∪ (B − A) ∪ (A ∩ B) is exactly the partition of A ∪ B into its three non-overlapping regions. Therefore this entire expression equals A ∪ B.
Step 2: The full expression becomes (A ∪ B) − (A ∪ B) = φ.
Answer: Null set.
Confusing A − B with B − A. These are not equal. A − B is the elements in A but not B. B − A is the elements in B but not A. In NDA questions, swapping these two changes the answer from A to B or vice versa — a direct mark loss. Always re-read which set is being subtracted from which.
Assuming A ∪ C = B ∪ C implies A = B unconditionally. It only implies A = B when A ∩ C = B ∩ C. The additional disjointness condition (A ∩ C = φ and B ∩ C = φ) is what makes the argument work. Without it, C could "mask" differences between A and B.
Assuming A ∩ C = φ means C = φ. No. Disjoint sets are not empty sets. \{1, 2\} and \{3, 4\} are disjoint but neither is empty. This is Statement I in the 2026 PYQ and it is deliberately planted as a trap.
Forgetting that A − B ⊆ A, so (A − B) ∪ A = A. Candidates who reach step 3 of the simplification and then get stuck on (A − B) ∪ A often incorrectly write A − B as the final answer. Anything already inside A union-ed with A gives back A.
Applying De Morgan's law incorrectly under nested operations. (A ∪ B)' becomes A' ∩ B' — the operation flips from ∪ to ∩. Candidates frequently forget to flip the operation and keep ∪, leading to A' ∪ B' which is (A ∩ B)', a completely different set.
Inclusion-exclusion sign error for three sets. The three-set formula adds the three pairwise intersections back subtracted, then adds the triple intersection. A common error is to subtract the triple intersection instead of adding it. Remember: the triple intersection is subtracted twice when you subtract the three pairwise terms, so it must be added back once.