• Practice
  • About 25 min
  • 15 practice questions

Final self-assessment: Sets and relations practice

Test yourself on the whole course: 15 questions with answers explained.

If something looks wrong, please tell us.

Attempt all 15 questions in one sitting, aiming for about a minute each, before you check any answer. They mix all five lessons and are a little harder than the lesson checks. Then read every explanation, including those for questions you got right, to compare your method with the quickest one.

Final self-assessment

  1. 1. How many elements does {x : x ∈ Z, x² − 3x − 4 ≤ 0} have?

    1. 4
    2. 5
    3. 6
    4. 7
    Show answer

    Answer: C. x² − 3x − 4 = (x − 4)(x + 1) ≤ 0 for −1 ≤ x ≤ 4. The integers −1, 0, 1, 2, 3, 4 give 6 elements.

  2. 2. Which of these sets is NOT empty?

    1. {x : x ∈ R, x² + 4 = 0}
    2. {x : x ∈ N, 3 < x < 4}
    3. {x : x ∈ Z, x² = 4}
    4. {x : x ∈ Q, x² = 2}
    Show answer

    Answer: C. x² = 4 gives {−2, 2}. There is no real square equal to −4, no natural number strictly between 3 and 4, and no rational number whose square is 2.

  3. 3. What is {x : x = 2n − 1, n ∈ N, n ≤ 6} in roster form?

    1. {1, 3, 5, 7, 9, 11}
    2. {1, 3, 5, 7, 9, 11, 13}
    3. {2, 4, 6, 8, 10, 12}
    4. {3, 5, 7, 9, 11}
    Show answer

    Answer: A. n = 1, 2, ..., 6 give 1, 3, 5, 7, 9, 11.

  4. 4. How many subsets of {1, 2, 3, 4, 5, 6, 7} contain 1 and 2 but not 7?

    1. 32
    2. 16
    3. 8
    4. 64
    Show answer

    Answer: B. 1, 2 and 7 have no choice; 3, 4, 5, 6 are free, giving 2^4 = 16 subsets.

  5. 5. A has m elements and B has n elements, and A has 48 more subsets than B. What is m + n?

    1. 9
    2. 11
    3. 10
    4. 8
    Show answer

    Answer: C. 2^m − 2^n = 48 = 16 × 3, so 2^n = 16 (n = 4) and 2^(m − n) = 4 (m = 6). m + n = 10. Check: 64 − 16 = 48.

  6. 6. What is n(P(P(P(∅))))?

    1. 4
    2. 2
    3. 3
    4. 8
    Show answer

    Answer: A. n(P(∅)) = 1, n(P(P(∅))) = 2^1 = 2, n(P(P(P(∅)))) = 2^2 = 4.

  7. 7. For all sets A and B, A ∪ (A' ∩ B) equals

    1. A ∪ B
    2. A
    3. B
    4. A ∩ B
    Show answer

    Answer: A. Regions: A = {1, 2} and A' ∩ B = {3}, so the union is {1, 2, 3} = A ∪ B. By laws: (A ∪ A') ∩ (A ∪ B) = U ∩ (A ∪ B).

  8. 8. For all sets A and B, (A ∩ B) ∪ (A − B) equals

    1. B
    2. A ∪ B
    3. A ∩ B
    4. A
    Show answer

    Answer: D. A ∩ B is region 2 and A − B is region 1; together they make A.

  9. 9. U = {1, 2, ..., 12}, A is the set of multiples of 2 in U and B the set of multiples of 3 in U. What is n((A ∪ B)')?

    1. 6
    2. 8
    3. 2
    4. 4
    Show answer

    Answer: D. (A ∪ B)' holds the numbers divisible by neither 2 nor 3: 1, 5, 7, 11. So n = 4.

  10. 10. n(A) = 25, n(B) = 20, n(C) = 15, n(A ∩ B) = 8, n(B ∩ C) = 6, n(A ∩ C) = 5 and n(A ∩ B ∩ C) = 3. How many elements are in exactly one of the sets?

    1. 44
    2. 31
    3. 22
    4. 37
    Show answer

    Answer: B. Exactly one = S1 − 2S2 + 3S3 = 60 − 2 × 19 + 3 × 3 = 31. Check: A only 15, B only 9, C only 7.

  11. 11. In a survey, 75% like tea and 65% like coffee. What is the least possible percentage who like both?

    1. 40%
    2. 25%
    3. 35%
    4. 65%
    Show answer

    Answer: A. The union cannot exceed 100%, so both ≥ 75 + 65 − 100 = 40%.

  12. 12. In a group of 80, everyone speaks Hindi or English or both; 50 speak Hindi and 45 speak English. How many speak English only?

    1. 30
    2. 45
    3. 35
    4. 15
    Show answer

    Answer: A. Both = 50 + 45 − 80 = 15. English only = 45 − 15 = 30.

  13. 13. A = {1, 2, 3}, B = {3, 4} and C = {4, 5, 6}. What is n(A × (B ∪ C))?

    1. 3
    2. 6
    3. 12
    4. 18
    Show answer

    Answer: C. B ∪ C = {3, 4, 5, 6} has 4 elements, so n(A × (B ∪ C)) = 3 × 4 = 12.

  14. 14. On Z, define a R b if ab ≥ 0. Then R is

    1. an equivalence relation
    2. reflexive and transitive but not symmetric
    3. reflexive and symmetric but not transitive
    4. symmetric and transitive but not reflexive
    Show answer

    Answer: C. a × a ≥ 0, and ab = ba, so R is reflexive and symmetric. But (1, 0) and (0, −1) are in R while 1 × (−1) = −1 < 0, so (1, −1) is not: not transitive.

  15. 15. On A = {1, 2, 3}, R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 1), (2, 3)}. What is the least number of pairs to add to make R an equivalence relation?

    1. 3
    2. 1
    3. 2
    4. 4
    Show answer

    Answer: A. Symmetry needs (3, 2). Then (1, 2), (2, 3) need (1, 3), and symmetry needs (3, 1). Adding (3, 2), (1, 3), (3, 1) gives all of A × A, which is an equivalence relation, and none of the three can be skipped.

Which lessons to revisit: Questions 1-3: lesson 1 (set notation and types). Questions 4-6: lesson 2 (subsets and power sets). Questions 7-9: lesson 3 (set operations and identities). Questions 10-12: lesson 4 (Venn diagram problems). Questions 13-15: lesson 5 (relations: products, counts and properties).

Privacy · Terms · Refunds · Delivery