CSE230

SETS
Complete Study Guide

Practice Sheet 3 · 32 Questions · 6 Units

Master every concept from set equality to inclusion-exclusion

01 02
Subsets, Power Sets &
03
Set Basics & Equality Cartesian Set Operations
Q1, Q4, Q6 Q2,3,5,11,12,13 Q7, Q8, Q9, Q17, Q18

04 05 06
Venn Diagrams Set Identities & Proofs Inclusion-Exclusion
Q10,14,15,26,27,28,30,31 Q16,19,20,21,22,24 Q23, Q25, Q29, Q32
DISCRETE MATHEMATICS · SETS STUDY GUIDE · CSE230 PAGE 2

UNIT 01

Set Basics & Equality

Set notation · Cardinality · Membership · Equal sets

Core Concepts
■ DEFINITION

Set: An unordered collection of DISTINCT objects (elements). Duplicates are ignored; order is irrelevant.
Two sets A = B iff they contain exactly the same elements — no more, no less.
Key symbols: ∈ (is in) ∉ (is not in) ⊆ (subset) ⊂ (proper subset)

■ CRITICAL: ∅ VS {∅} — MOST TESTED DISTINCTION

∅ = empty set → has 0 elements → |∅| = 0

{∅} = set CONTAINING the empty set → has 1 element → |{∅}| = 1
{{1}} = set containing {1} → 1 element (NOT the same as {1, {1}} which has 2)

Step-by-Step Framework
1 2 3 4
Remove all duplicates from each set Ignore order — mentally sort Compare element by element Same elements? → EQUAL

Solved Questions

Q1a
{1,3,3,3,5,5,5,5,5} vs {5,3,1}

Remove duplicates from left: {1, 3, 5}

Right side: {5, 3, 1} = {1, 3, 5}

■ EQUAL — same distinct elements

Q1b
{{1}} vs {1, {1}}

Left: 1 element — the set {1}

Right: 2 elements — the number 1 AND the set {1}

■ NOT EQUAL — different cardinalities: 1 ≠ 2

Q1c
∅ vs {∅}

∅ has 0 elements. {∅} has 1 element (the empty set itself).

■ NOT EQUAL — cardinality 0 ≠ 1

Q4 — Cardinality Reference

CSE230 · Exam Preparation Guide · All 32 Questions Practice Sheet 3: Sets

DISCRETE MATHEMATICS · SETS STUDY GUIDE · CSE230 PAGE 3

SET CARDINALITYREASON ANSWER

{a} | | One element: a 1

{{a}} | | One element: the set {a} 1

∅ | | Empty — no elements at all 0

{∅} | | One element: the empty set ∅ 1

{∅, {∅}} | | Two elements: ∅ and {∅} 2

{∅,{∅},{∅,{∅}}} || Three distinct objects 3

Q6 — True / False
STATEMENT ANSWER REASON

7 ∈ {6,7,8,9} ■ TRUE 7 appears in the set

5 ∉ {6,7,8,9} ■ TRUE 5 is not listed

{2} ■ {1,2} ■ FALSE {2} IS a subset — 2 ∈ {1,2}

∅ ■ {α,β,x} ■ FALSE ∅ ⊆ EVERY set — always

∅ = {∅} ■ FALSE Cardinalities differ: 0 ≠ 1

MENTAL TRICK
■
Count the outermost comma-separated objects inside the braces. That number IS the cardinality. Nested
braces = single element. ∅ inside { } = 1 element!

CSE230 · Exam Preparation Guide · All 32 Questions Practice Sheet 3: Sets

DISCRETE MATHEMATICS · SETS STUDY GUIDE · CSE230 PAGE 4

UNIT 02

Subsets, Power Sets & Cartesian

P(A) · 2■ rule · A×B · ordered pairs

POWER SET SIZE

|P(A)| = 2■ where n = |A|

Always a power of 2. P(A) always includes ∅ and A itself.

CARTESIAN PRODUCT SIZE

|A × B| = |A| × |B|
A×B ≠ B×A in general — ordered pairs (a,b) ≠ (b,a)

Framework: Building a Power Set

1 2 3 4 5 6
Count elements n Start with ∅ Add single-element Add pairs, triples... Include full set A Verify: count = 2■
subsets

Solved: Q2 — Size of Power Sets

Q2a
P({a, b, {a,b}})

Count distinct elements: a, b, and {a,b} → n = 3

|P(A)| = 2³ = ■ 8

Q2b
P({∅, a, {a}, {{a}}})

Four distinct elements: ∅, a, {a}, {{a}} → n = 4

|P(A)| = 2■ = ■ 16

Q2c
P(P(∅))

Step 1: P(∅) = {∅} — power set of empty set has exactly 1 element

Step 2: P({∅}) — this set has n = 1 element

|P(P(∅))| = 2¹ = ■ 2 and P(P(∅)) = {∅, {∅}}

Solved: Q3 — List All Subsets

Q3a
Subsets of {1, 2, 3} — 2³ = 8 subsets

∅, {1}, {2}, {3}, {1,2}, {1,3}, {2,3}, {1,2,3}

CSE230 · Exam Preparation Guide · All 32 Questions Practice Sheet 3: Sets

DISCRETE MATHEMATICS · SETS STUDY GUIDE · CSE230 PAGE 5

Q3c
Subsets of {∅} — element is the empty set — 2¹ = 2 subsets

∅ (the empty subset) and {∅} (the set itself)

Solved: Q5 — Full Power Sets

Q5a
P({q})

n = 1 → 2 elements: P({q}) = {∅, {q}}

Q5b
P({p, q})

n = 2 → 4 elements: P({p,q}) = {∅, {p}, {q}, {p,q}}

Q5c
P({∅, {∅}}) — The set has 2 elements: ∅ and {∅}

n = 2 → 4 subsets:

∅ (empty subset), {∅}, {{∅}}, {∅,{∅}}

Solved: Q11 — A³

Q11a
A = {0} → A³ = A×A×A

Only one triple possible: A³ = {(0,0,0)}

Q11b
A = {0, a} → A³

|A³| = 2³ = 8 triples:

(0,0,0) (0,0,a) (0,a,0) (0,a,a) (a,0,0) (a,0,a) (a,a,0) (a,a,a)

Solved: Q13 — Cartesian Product

Q13
A = {1,2,3}, B = {x, {y}} — Find A×B and B×A

A×B = {(1,x),(1,{y}),(2,x),(2,{y}),(3,x),(3,{y})}

B×A = {(x,1),(x,2),(x,3),({y},1),({y},2),({y},3)}

Equal? ■ NO — ordered pairs reversed. |B×A| = 2×3 = ■ 6

■
In Cartesian products, {y} is a SINGLE element (a set object). So (1,{y}) is perfectly valid — do not expand {y} into its
contents.

MENTAL TRICK
■
Power set → count n → write 2■. Cartesian product → multiply the sizes. Two formulas, endless questions.
Memorise them cold!

CSE230 · Exam Preparation Guide · All 32 Questions Practice Sheet 3: Sets

DISCRETE MATHEMATICS · SETS STUDY GUIDE · CSE230 PAGE 6

UNIT 03

Set Operations
Union · Intersection · Difference · Complement

Operations Quick Reference

A ∪ B (UNION) A ∩ B (INTERSECTION)

All in A OR B Only in BOTH A and B

A − B (DIFFERENCE) A■ (COMPLEMENT)

In A but NOT in B In U but NOT in A

DISJOINT A⊆B

A ∩ B = ∅ A∪B=B and A∩B=A

Framework: Computing Any Operation

1 2 3 4 5
Write sets, strip duplicates UNION: list all (no dupes) INTERSECT: elements in both DIFF A−B: A minus B's COMP: U minus A's elements
elements

Solved: Q7 — Operations on A, B, C, D

Q7
A={1,5,31,56,101} B={22,56,5,103,87} C={41,13,7,101,48} D={1,3,5,7...} (odd positives)

a) A∩B = {5, 56} — elements in both A and B

b) C∪A = {1,5,7,13,31,41,48,56,101} — everything in C or A

c) C∩D: odd elements of C = {41,13,7,101} (48 is even → excluded)

d) (A∪B)∪(C∪D) = A∪B∪C∪D — includes all elements from all four sets

Solved: Q8 — Fill in the Symbol

■ GIVEN SETS

A={−7,−5,−3,−1,1,3,5,7} B={−2,−1,0,1,2} C={2,3,4,5,6} D={x∈■ | x≤9}

CSE230 · Exam Preparation Guide · All 32 Questions Practice Sheet 3: Sets

DISCRETE MATHEMATICS · SETS STUDY GUIDE · CSE230 PAGE 7

STATEMENT SYMBOL REASON

i. A ___ D ⊆ All elements of A are ≤7, so all are ≤9 → in D

ii. 3 ___ B ∉ B={−2,−1,0,1,2}; 3 is not listed

iii. 9 ___ D ∈ D = integers ≤ 9; 9 qualifies

iv. {2} ___ C■ ⊄ 2 ∈ C so 2 ∉ C■, meaning {2} is not a subset of C■

v. ∅ ___ D ⊆ Empty set is subset of every set

vi. A ___ C ≠ Completely different elements

vii. B ___ C ⊄ B has −2,−1,0 which are not in C

viii. C ___ D ⊆ All of 2–6 are ≤ 9

ix. 0 ___ A∩D ∉ A∩D = A; 0 not in A

x. 0 ___ A∪D ∈ A∪D = D; 0 ≤ 9 so 0 ∈ D

Solved: Q17 & Q18

Q17
A={1,2,3,4,5} B={0,3,6}

a) A∪B = {0,1,2,3,4,5,6}

b) A∩B = {3}

c) A−B = {1,2,4,5} d) B−A = {0,6}

Q18
A={a,b,c,d,e} B={a,b,c,d,e,f,g,h} — Note: A ⊆ B

a) A∪B = B = {a,b,c,d,e,f,g,h}

b) A∩B = A = {a,b,c,d,e}

c) A−B = ∅ d) B−A = {f,g,h}

MENTAL TRICK
■
Spot A⊆B → instantly: A∪B=B, A∩B=A, A−B=∅. Three answers in one second!

CSE230 · Exam Preparation Guide · All 32 Questions Practice Sheet 3: Sets

DISCRETE MATHEMATICS · SETS STUDY GUIDE · CSE230 PAGE 8

UNIT 04

Venn Diagrams
Region reading · Shading · Logical sets · 3-circle diagrams

The 8 Regions of a 3-Circle Venn Diagram

■ 3-CIRCLE STRUCTURE

A 3-set Venn diagram has exactly 8 disjoint regions:

① A only ② B only ③ C only ④ A∩B only ⑤ A∩C only ⑥ B∩C only ⑦ A∩B∩C ⑧ Outside all
Each number in a region = elements EXCLUSIVELY in that zone.
For Q31: With no pairwise disjoint sets and P∩Q∩T≠∅ → there are 8 regions. (T∩Q)■−P = regions NOT in T∩Q
AND not in P = the outside region and A-only, B-only, C-only, etc.

Framework: Reading Numbers from a Venn Diagram

1 2 3 4 5
Label all 8 regions n(X) = add ALL regions inside n(X∩Y) = only shared zones n(X■) = total OUTSIDE X n(U) = sum everything
X

Solved: Q26 — Three-Circle Cardinality

■ READING THE DIAGRAM

Diagram values: R only=26 · R∩E only=9 · E only=41 · R∩N only=4 · Center(R∩E∩N)=7 · E∩N
only=13 · N only=37 · Outside=76

QUESTION REGIONS TO ADD ANSWER

1. n(N) 4 + 7 + 13 + 37 (all inside N) 61

2. n[(R∩E)∪N] R∩E: 9,7 + all of N: 4,13,37 = unique sum 70

3. n(E■) Outside E: 26 + 4 + 37 + 76 143

4. n(E\R) In E not in R: 41 + 13 54

5. n(U) All regions: 26+9+41+4+7+13+37+76 213

6. n(R∪E∪N) All inside circles: 26+9+41+4+7+13+37 137

Solved: Q30 — Deer Activities

■ DIAGRAM VALUES

R only=3 · R∩N only=8 · N only=7 · R∩S only=13 · Center=21 · N∩S only=18 · S only=25 ·
Outside=14

CSE230 · Exam Preparation Guide · All 32 Questions Practice Sheet 3: Sets

DISCRETE MATHEMATICS · SETS STUDY GUIDE · CSE230 PAGE 9

QUESTION CALCULATION ANSWER

a) Enjoy R or S 3+8+13+21+18+7+25 (all R ∪ S regions) 95

b) Enjoy N and R R∩N all zones: 8 + 21 29

c) Exactly one R only + N only + S only = 3+7+25 35

d) S but not R N∩S only + S only = 18+25 43

e) Enjoy N 8+21+18+7 (all of N circle) 54

f) No activities Outside all circles 14

g) Exactly two R∩N only + R∩S only + N∩S only=8+13+18 39

Q10 — Logic-Based Sets

■ LOGICAL CONNECTIVES AS SETS

Q10a: A → B = {x | x∈A → x∈B}

Logic: P→Q is FALSE only when P=T and Q=F. So A→B FAILS only when x∈A AND x∉B.
Therefore: A→B = A■ ∪ B (everything EXCEPT the A-only region outside B)

Q10b: A ↔ B = {x | x∈A ↔ x∈B}

A↔B is TRUE when both memberships match. Regions: A∩B (both in) PLUS outside A∪B (both out).
Therefore: A↔B = (A∩B) ∪ (A∪B)■

MENTAL TRICK
■
For complement/shading: identify what is EXCLUDED by the operation, then shade everything else.
Complement = flip the shading mentally!

CSE230 · Exam Preparation Guide · All 32 Questions Practice Sheet 3: Sets

DISCRETE MATHEMATICS · SETS STUDY GUIDE · CSE230 PAGE 10

UNIT 05

Set Identities & Proofs

Membership tables · Double inclusion · Algebraic proofs

Master Identity Table

IDENTITY LAWS DOMINATION LAWS

A∪∅=A | A∩U=A A∪U=U | A∩∅=∅

IDEMPOTENT LAWS COMPLEMENT LAWS

A∪A=A | A∩A=A A∪A■=U | A∩A■=∅

DOUBLE COMPL. COMMUTATIVE

(A■)■ = A A∪B=B∪A | A∩B=B∩A

ASSOCIATIVE DISTRIBUTIVE

(A∪B)∪C=A∪(B∪C) A∩(B∪C)=(A∩B)∪(A∩C)

DE MORGAN 1 DE MORGAN 2

(A∪B)■ = A■∩B■ (A∩B)■ = A■∪B■

ABSORPTION 1 ABSORPTION 2

A∪(A∩B) = A A∩(A∪B) = A

Solved: Q19b — Membership Table Proof

■ METHOD: MEMBERSHIP TABLE

Prove: (A∪B)■ = A■ ∩ B■
Write 1 = element IS in the set, 0 = element is NOT in the set:

A B A∪B (A∪B)■ ← A■ B■ A■∩B■ ←

1 1 1 0 0 0 0

1 0 1 0 0 1 0

0 1 1 0 1 0 0

0 0 0 1 1 1 1

Columns "(A∪B)■" and "A■∩B■" are IDENTICAL → Identity PROVED ■

Solved: Q19a — Double Inclusion (Subset) Proof

CSE230 · Exam Preparation Guide · All 32 Questions Practice Sheet 3: Sets

DISCRETE MATHEMATICS · SETS STUDY GUIDE · CSE230 PAGE 11

1 2 3 4
Take x ∈ (A∪B)■ Then x∉A∪B → x∉A AND x∉B So x∈A■ AND x∈B■ Therefore x∈A■∩B■ ✓ LHS⊆RHS

1 2 3 4
Take x ∈ A■∩B■ Then x∈A■ AND x∈B■ So x∉A AND x∉B → x∉A∪B Therefore x∈(A∪B)■ ✓ RHS⊆LHS

Solved: Q21 — Algebraic Proof Using Identities

■ GOAL

Show: (A ∪ (B∩C))■ = (C■ ∪ B■) ∩ A■

(A ∪ (B∩C))■ Starting expression

= A■ ∩ (B∩C)■ De Morgan: (X∪Y)■ = X■∩Y■

= A■ ∩ (B■ ∪ C■) De Morgan: (B∩C)■ = B■∪C■

= (B■ ∪ C■) ∩ A■ Commutative: swap order of ∩

= (C■ ∪ B■) ∩ A■ ■ Commutative: swap B■ and C■

Solved: Q16 — Transitivity of Subsets

■ PROOF

Prove: If A⊆B and B⊆C, then A⊆C

Let x be any element with x ∈ A.
Since A ⊆ B → x ∈ B
Since B ⊆ C → x ∈ C
∴ For any x∈A we have x∈C. By definition, A⊆C ■

MENTAL TRICK
■
For any subset proof: "Let x ∈ LHS..." → chase x through conditions → show x ∈ RHS. This template works
for EVERY set inclusion proof!

CSE230 · Exam Preparation Guide · All 32 Questions Practice Sheet 3: Sets

DISCRETE MATHEMATICS · SETS STUDY GUIDE · CSE230 PAGE 12

UNIT 06

Inclusion-Exclusion & Word Problems

Survey problems · 2-set and 3-set formulas · Venn filling

2-SET FORMULA

|A∪B| = |A| + |B| − |A∩B|

n(A∩B) = n(A) + n(B) − n(A∪B) ← rearranged for intersection

3-SET FORMULA

|A∪B∪C| = |A|+|B|+|C|−|A∩B|−|A∩C|−|B∩C|+|A∩B∩C|
Add individuals, subtract pairs, add triple back

Key Derived Formulas

■ THE THREE KEY DERIVED QUANTITIES

Exactly two = (pairwise sum) − 3×(triple)

where pairwise sum = |A∩B| + |A∩C| + |B∩C|
At least two = exactly two + exactly three (all three)
Exactly one = |A only| + |B only| + |C only|
= |A∪B∪C| − (at least two)

Framework: Solving 3-Set Word Problems

1 2 3 4 5 6
Identify all given values: Place triple in center of Each pair-only = pair − Each single-only = Outside = U − all regions Answer using filled
individuals, pairs, triple, Venn triple individual − its pair-onlys inside diagram
total − triple

Solved: Q23

Q23
n(A)=20, n(B)=28, n(A∪B)=36. Find n(A∩B).

Formula: |A∪B| = |A| + |B| − |A∩B|

36 = 20 + 28 − |A∩B|

|A∩B| = 48 − 36 = ■ 12

Q25
200 students: Leadership(L)=85, Team-building(T)=50, Both=15. Find exactly one.

Only L = 85 − 15 = 70

Only T = 50 − 15 = 35

Exactly one = 70 + 35 = ■ 105 students

CSE230 · Exam Preparation Guide · All 32 Questions Practice Sheet 3: Sets

DISCRETE MATHEMATICS · SETS STUDY GUIDE · CSE230 PAGE 13

Q29
F=24, N=14, R=27, F∩R=12, R∩N=9, F∩N=7, F∩R∩N=5, Total=43

Center = 5

F∩R only = 12−5=7 · R∩N only = 9−5=4 · F∩N only = 7−5=2

F only = 24−7−2−5=10 · N only = 14−2−4−5=3 · R only = 27−7−4−5=11

Sum inside = 10+3+11+7+4+2+5 = 42 → Outside = 43−42 = ■ 1 student did nothing

Q32
U=1200, S=670, B=510, Ba=760, all three=320, none=45

|S∪B∪Ba| = 1200−45 = 1155

1155 = 670+510+760 − pairwise + 320

pairwise sum = 1940+320−1155 = ■ 1105

a) Exactly two = 1105 − 3×320 = 1105−960 = ■ 145

b) At least two = 145+320 = ■ 465

c) Exactly one = 1155−465 = ■ 690

MENTAL TRICK
■
In 3-set problems: pairwise sum = individual_total + triple − |union|. Then exactly_two = pairwise_sum −
3×triple. Two derived formulas solve almost every word problem!

CSE230 · Exam Preparation Guide · All 32 Questions Practice Sheet 3: Sets

DISCRETE MATHEMATICS · SETS STUDY GUIDE · CSE230 PAGE 14

UNIT ★

Exam Strategy & Formula Card

Fastest recognition · Common mistakes · Mental tricks

Instant Question Recognition

IF YOU SEE... QUESTION TYPE YOUR FIRST MOVE

= between two sets Set Equality Remove dupes, compare

|A| or "how many elements" Cardinality Count outermost objects

P(A) or "power set" Power Set Count n → 2■

A×B or "ordered pairs" Cartesian Product |A|×|B| combos

∪ ∩ − complement Set Operations Apply definition directly

Venn + numbers in regions Diagram cardinality Add correct regions

Prove (X)■ = ... Membership table Build 4-row truth table

Prove A⊆B... Subset proof "Let x ∈ A..." then chase x

Word problem: and/or/both Inclusion-Exclusion Draw Venn, fill center-out

Using De Morgan / identities Algebraic proof Apply named law, step by step

Top 10 Mistakes — Never Make These

■
1. ∅ ≠ {∅}. Empty set = 0 elements. {∅} = 1 element. This is the #1 trap.

■
2. {1,1,2} = {1,2}. Duplicates are ALWAYS removed. Cardinality = 2, not 3.

■
3. P(∅) = {∅} NOT ∅. Power set of empty set has 1 element.

■
4. A×B ≠ B×A. Cartesian product is NOT commutative — order of pairs matters.

■
5. A−B ≠ B−A. Set difference is NOT commutative.

■
6. Complement depends on U! Always identify the universe before computing A■.

■
7. In 3-set problems, A∩B includes the triple overlap. Subtract A∩B∩C to get "A∩B only".

■
8. Power set: ALWAYS include ∅ as first element. Forgetting ∅ costs marks.

■
9. A ⊂ B (proper) means A ≠ B. A ⊆ B allows them to be equal.

■
10. In subset proofs: NEVER start from the conclusion. Always start "Let x ∈ LHS..."

CSE230 · Exam Preparation Guide · All 32 Questions Practice Sheet 3: Sets

DISCRETE MATHEMATICS · SETS STUDY GUIDE · CSE230 PAGE 15

All Formulas at a Glance

POWER SET SIZE CARTESIAN SIZE

|P(A)| = 2■, n=|A| |A×B| = |A| × |B|

2-SET IE 3-SET IE

|A∪B|=|A|+|B|−|A∩B| |A∪B∪C|=Σ|A|−Σ|A∩B|+|A∩B∩C|

EXACTLY TWO AT LEAST TWO

pairwise_sum − 3×triple exactly_two + exactly_three

DE MORGAN 1 DE MORGAN 2

(A∪B)■ = A■∩B■ (A∩B)■ = A■∪B■

A⊆B EQUIV. DISTRIBUTIVE

A∩B=A ■ A∪B=B A∩(B∪C)=(A∩B)∪(A∩C)

You have all the tools. Apply the frameworks. Trust the formulas. Ace the exam. ■

CSE230 · Exam Preparation Guide · All 32 Questions Practice Sheet 3: Sets