SET 12 · Practice Problems
How to use
30 problems in three levels. Answers are collapsed — commit before you click. Score: Easy 1 · Medium 2 · Hard 3 → total 60. Aim for ≥ 48. MSQ = multiple correct options, NAT = numeric.
🟢 Level 1 — Easy
E1. Is “the set of tall students in your class” a set?
👁 Show answer
No — “tall” isn’t well-defined. → SET 01 Basics and Representation
E2. Find .
👁 Show answer
3 — duplicates don’t count.
E3. Is ? Is ?
👁 Show answer
Sets: yes (order doesn’t matter). Ordered pairs: no.
E4. . True or false: (i) 2 ∈ A (ii) {2} ∈ A (iii) {1} ⊆ A (iv) {2} ⊆ A
👁 Show answer
(i) F (ii) T (iii) T (1 ∈ A) (iv) F (2 ∉ A)
E5. Find , , .
👁 Show answer
0, 1, 2
E6. List .
👁 Show answer
{ϕ, {x}, {y}, {x, y}}
E7. A = {1, 2}, B = {a}. Find A×B and B×A.
👁 Show answer
A×B = {(1,a), (2,a)}; B×A = {(a,1), (a,2)} — different.
E8. A = {1,2,3,4,5}, B = {4,5,6}. Find A∪B, A∩B, A−B, B−A, A⊕B.
👁 Show answer
A∪B = {1,2,3,4,5,6} · A∩B = {4,5} · A−B = {1,2,3} · B−A = {6} · A⊕B = {1,2,3,6}
E9. U = {1, …, 10}, A = even numbers in U. Find A’.
👁 Show answer
{1, 3, 5, 7, 9}
E10. Write {2, 4, 6, …} in set-builder form.
👁 Show answer
(positive even integers)
🟡 Level 2 — Medium (GATE 1-mark style)
M1. (NAT) = ?
👁 Show answer
4 — sizes go 0 → 1 → 2 → 4.
M2. (NAT) |A| = 5. How many (i) proper subsets (ii) non-empty proper subsets (iii) subsets of size 2?
👁 Show answer
(i) (ii) (iii)
M3. (NAT) |A| = 3, |B| = 4. Find and .
👁 Show answer
12 and
M4. (MSQ) . Which are true? (A) 1 ∈ A (B) {1} ∈ A (C) {1} ⊆ A (D) {{1, {1}}} ∈ A
👁 Show answer
A, B, C. (C) holds since 1 ∈ A. (D) is false: A’s items are 1, {1}, {1,{1}} — {{1,{1}}} isn’t one of them (though {{1,{1}}} ⊆ A would be true).
M5. Simplify .
👁 Show answer
M6. Simplify .
👁 Show answer
M7. Is ?
👁 Show answer
Yes. — De Morgan.
M8. If , what is B?
👁 Show answer
B = ϕ. ⊕ A on both sides: .
M9. (NAT) |A| = 10, |B| = 15, |A ∩ B| = 4. Find |A ∪ B| and |A ⊕ B|.
👁 Show answer
|A∪B| = 10 + 15 − 4 = 21 · |A⊕B| = 21 − 4 = 17
M10. When is ?
👁 Show answer
When A = B, or A = ϕ, or B = ϕ.
🔴 Level 3 — Hard (GATE 2-mark style)
H1. (NAT) 60 students: 30 know C, 25 Java, 20 Python; 10 know C & Java, 8 Java & Python, 7 C & Python, 4 all three. How many know none?
👁 Show answer
6. Union = 30 + 25 + 20 − 10 − 8 − 7 + 4 = 54 ⇒ none = 60 − 54. → SET 10 Beyond the Slides
H2. (NAT) Same data: how many know exactly one language?
👁 Show answer
37. Only C = 30−10−7+4 = 17, only Java = 25−10−8+4 = 11, only Python = 20−8−7+4 = 9. Check: exactly two = 6 + 4 + 3 = 13, all three = 4 ⇒ 37 + 13 + 4 = 54 ✓
H3. Is ? Prove or disprove.
👁 Show answer
Not equal. A = B = C = {1}: LHS = ϕ − {1} = ϕ, RHS = {1} − ϕ = {1}. In general only holds.
H4. Compare with .
👁 Show answer
, not equal in general. A = {1}, B = {2}: {1,2} ∈ P(A∪B) but not in P(A) ∪ P(B). (By contrast always.)
H5. If , must B = C?
👁 Show answer
Yes. ⊕ A on both sides: . (Contrast: does not imply B = C.)
H6. Which elements are in ?
👁 Show answer
Those in an odd number of the sets: exactly one, or all three (regions 1, 2, 3, 7).
H7. Is ? If not, when are they equal?
👁 Show answer
Not in general. A = ϕ, C = {1}: LHS = {1}, RHS = ϕ. Equal iff C ⊆ A: , and exactly when C ⊆ A.
H8. (MSQ) Which sets are countable? (A) ℤ (B) ℚ (C) P(ℕ) (D) the set of all finite binary strings
👁 Show answer
A, B, D. P(ℕ) is uncountable (Cantor). Finite strings can be listed by length, then alphabetically.
H9. (NAT) |A| = 2, |B| = 3. Find .
👁 Show answer
32
H10. (MSQ) Given , which must be true? (A) (B) (C) (D)
👁 Show answer
A, C, D. (B) is wrong: A ∪ B = B.
📊 Score log
| Attempt | Date | Easy /10 | Medium /20 | Hard /30 | Total /60 |
|---|---|---|---|---|---|
| 1 | |||||
| 2 |
Prev ← SET 11 GATE PYQs · Next → SET 13 Flashcards