0% found this document useful (0 votes)
10 views7 pages

Understanding Sets and Relations Concepts

The document discusses sets and relations including concepts like subsets, unions, intersections, cardinality and properties of relations. It contains 26 multiple choice questions related to these topics, asking learners to identify subsets, cardinalities, properties of relations and solve problems involving sets and relations.
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
10 views7 pages

Understanding Sets and Relations Concepts

The document discusses sets and relations including concepts like subsets, unions, intersections, cardinality and properties of relations. It contains 26 multiple choice questions related to these topics, asking learners to identify subsets, cardinalities, properties of relations and solve problems involving sets and relations.
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Sets and relation

1. The number of all possible subsets of a set 6. If 𝐴 = {1,2,3,4}, 𝐵 = {2,4,5,6} and 𝐶 =


containing 𝑛 elements is: {1,2,5,7,8}, then (𝐴 ∩ 𝐶 ) ∩ 𝐵 =?
(a) 𝑛 (a) {1,2,5}
(b) 2𝑛 (b) {2,4,5}
(c) 𝑛 ! (c) {1,2,4,5,7,8}
𝑛
(d) 2 (d) {1,2,3,4,5,7,8}
2. If 𝛼 finite sets 𝑆 contains 𝑛 elements, then 7. If 𝑈 = {1,2,3,4, … ,10}, 𝐴 = {1,3,5,7} and
the number of all non-empty proper 𝐵 = {1,2,3,4,5}, then(𝐴 ∪ 𝐵) =?
subset of 𝑆 is: (a) {2,4,6,8,9,10}
𝑛
(a) 2 (b) {2,6,7,8,9,10}
𝑛
(b) 2(2 − 1) (c) {2,4,6,7,9,10}
𝑛−1
(c) (2 − 2) (d) {2,4,6,7,8,9,10}
𝑛−1
(d) (2 − 1) 8. The number of all possible subsets of 𝐴 =
3. The number of non-empty subsets of
{1, {2,3}} is
{𝑎, 𝑏, 𝑐, 𝑑} is
(a) 2
(a) 3
(b) 4
(b) 4
(c) 6
(c) 15
(d) 8
(d) 16
9. Consider the following statements:
4. Which one of the following statements is
I. Every subset of an infinite set is infinite.
correct?
II. Every set has a proper subset.
(a) {1} ∈ {1,2}
III. For any two sets 𝐴 and 𝐵.
(b) 1 ∪ {1,2}
IV. {𝑥: 𝑥 + 6 = 6} = 𝜙
(c) {1,3} ∈ {𝑥|𝑥 𝑖𝑠 𝑎 +ve integer}
Of these statements:
(d) {1,2} ⊆ {2,1}
(a) I, II and III are correct.
5. If 𝐴 and 𝐵 are two sets given in such a
(b) Only II and III are correct.
way that 𝑛(𝐴) = 70, 𝑛(𝐵) = 60 and
(c) Only II and IV are correct.
𝑛(𝐴 ∪ 𝐵) = 110, then 𝑛(𝐴 ∩ 𝐵) =?
(d) None of these is correct.
(a) 240
10. If 𝐴 = {𝑥: 𝑥 is a multiple of 4} and 𝐵 =
(b) 50
{𝑥: 𝑥 is a multiple of 6}, then 𝐴 ∩ 𝐵
(c) 40
consists of all multiples of:
(d) 20
(a) 24
(b) 2
(c) 12 Of these statements
(d) 4 (a) I and II are true
11. If 𝑥 is a positive integer, then the solution (b) I and III are true
set of the equation 𝑥 + 2 = 0 is: (c) II and III are true
(a) {−2} (d) I, II and III are all true
(b) {2} 16. In a school, there are 20 teachers who can
(c) 𝜙 teach either Mathematics or Physics.
(d) {𝜙} There are 12 teachers who teach
12. If A is the set of all positive integers and B Mathematics and there are 9 teachers
is the set of all negative integers, then 𝐴 ∩ who teach both Mathematics and Physics.
𝐵 =? The number of teachers who teach
(a) {0} Physics is:
(b) 𝜙 (a) 13
(c) 0
(b) 17
(d) {𝜙} (c) 19
13. Consider the following statements:
(d) 23
I. {𝑎} ∈ {𝑎, 𝑏, 𝑐}
17. If A and B are two subsets of a set X such
II. 𝑎 ⊆ {𝑎, 𝑏, 𝑐}
that 𝑛(𝑋) = 900, 𝑛(𝐴) = 300, 𝑛(𝐵) =
III. 𝜙 ∈ {𝑎, 𝑏, 𝑐}
400 and 𝑛(𝐴 ∩ 𝐵) = 150. Then, 𝑛(𝐴′ ∩
IV. 𝑎 ∈ {{𝑎}, 𝑏}
𝐵′ ) =?
Of these statements: (a) 250
(a) Only II is true (b) 350
(b) II and III are true (c) 400
(c) III and IV are true (d) 450
(d) None of these 18. Two finite sets have 𝑚 and 𝑛 elements.
14. Which of the following statements is The total number of subsets of the first
true? set is 56 more than the total number of
(a) {𝑎} ⊆ {{𝑎}, 𝑏, 𝑐} subsets of the second set. The values of 𝑚
(b) {𝑎} ∈ {{𝑎}, 𝑏, 𝑐} and 𝑛 are:
(c) {𝑎, 𝑏} ⊆ {{𝑎}, 𝑏, 𝑐} (a) 𝑚 = 6, 𝑛 = 7
(d) {𝑎, 𝑏} ∈ {{𝑎}, 𝑏, 𝑐} (b) 𝑚 = 3, 𝑛 = 6
15. Consider the following statements: (c) 𝑚 = 7, 𝑛 = 8
I. Any set A is comparable with itself. (d) 𝑚 = 1, 𝑛 = 5
II. {0} is a singleton set.
III. {𝜙} is an empty set.
19. A class has 175 students. The following (d) (1,5), (2,3), (3,5)
data shows the number of students 22. 𝐴 × (𝐵 ∪ 𝐶 ) =?
opting one or more subjects: (a) (𝐴 × 𝐵) ∪ (𝐴 × 𝐶 )
Mathematics 100; Physics 70; (b) (𝐴 × 𝐵) ∩ (𝐴 × 𝐶 )
Chemistry 40; Mathematics and Physics (c) (𝐴 ∪ 𝐵) × (𝐴 ∪ 𝐶 )

30; (d) None of these

Mathematics and Chemistry 28; 23. 𝐴 × (𝐵 ∩ 𝐶 ) =?

Physics and Chemistry 23; (a) (𝐴 × 𝐵) ∪ (𝐴 × 𝐶 )

Mathematics, Physics & Chemistry 18; (b) (𝐴 × 𝐵) ∩ (𝐴 × 𝐶 )

How many students have offered (c) (𝐴 ∩ 𝐵) × (𝐴 ∩ 𝐶 )


(d) None of these
Mathematics alone?
24. 𝐴 × (𝐵 − 𝐶 ) =?
(a) 35
(a) (𝐴 × 𝐵) − (𝐴 × 𝐶 )
(b) 48
(b) (𝐴 − 𝐵) × (𝐴 − 𝐶 )
(c) 60
(c) (𝐴 − 𝐶 ) × (𝐴 − 𝐵)
(d) 22
(d) None of these
20. The following data shows the number of
25. If A and B have 𝑛 elements in common,
players in three athletic teams in a school:
then the number of elements common to
Basket Ball 21; Hockey 26; Football 29;
(𝐴 × 𝐵) and (𝐵 × 𝐴) is:
Hockey and Basket Ball 14;
(a) 𝑛
Football and Basket Ball 12;
(b) 𝑛 !
Hockey and Football 15; 𝑛
(c) 2
Hockey, Football & Basket Ball 8.
(d) 𝑛2
How many players are there in all?
26. Let S be the set of all straight lines in a
(a) 76
plane. A relation R is defined on S by
(b) 68
𝒂𝑹𝒃 ⇔ 𝒂 ⊥ 𝒃. Then R is:
(c) 43
(a) Reflexive but neither symmetric nor
(d) 53
transitive.
21. If A and B are two sets given in such a way
(b) Symmetric but neither reflexive nor
that A x B contains 6 elements. If 3
transitive.
elements of A x B be (1,3), (2,5) and (3,3),
(c) Transitive but neither reflexive nor
then its remaining elements are:
symmetric.
(a) (1,1), (2,3), (3,5)
(d) An equivalence relation.
(b) (1,2), (2,3), (3,5)
(c) (1,5), (2,2), (3,5)
27. Let S be the set of all straight lines in a (b) Reflexive, transitive and
plane. 𝐴 relation 𝑅 is defined on 𝑆 by: antisymmetric.
𝒂𝑹𝒃 ⇔ 𝒂 ∥ 𝒃. Then, 𝑅 is: (c) An equivalence relation.
(a) Reflexive, but neither symmetric nor (d) None of these
transitive. 31. Let R be a relation on the set N of all
(b) Symmetric and transitive but not natural numbers, defined by 𝒂𝑹𝒃 ⇔ 𝒂 is
reflexive. a factor of 𝒃. Then, R is
(c) Reflexive and symmetric but not (a) Reflexive and symmetric, but not
transitive. transitive.
(d) An equivalence relation (b) Symmetric and transitive, but not
28. Let 𝐴 be the set of all triangle in a plane. reflexive.
Let 𝑅 be the relation on 𝐴 defined by: (c) Reflexive and transitive but not
∆1 𝑅∆2 ⇔ ∆1 ≅ ∆2 Then, the relation 𝑅 is: symmetric.
(a) Reflexive and symmetric but not (d) An equivalence relation
transitive 32. Let 𝑅 be 𝑎 relation on the set I of all
(b) Symmetric and transitive but not integers, defined by: 𝒂𝑹𝒃 ⇔ (𝒂 − 𝒃) is
reflexive divisible by 3. Then, 𝑅 is
(c) Reflexive and transitive but not (a) An equivalence relation.
symmetric (b) Reflexive and symmetric but not
(d) An equivalence relation transitive.
29. Let A = {1, 2, 3}. Then, the relation R = (c) Symmetric and transitive, but not
{(1,1), (2,2), (3,3), (1,2), (2,1), (2,3), (3,2)} reflexive.
on A is: (d) None of these
(a) Reflexive and transitive but not 33. Let S be the set of al real numbers. Define
symmetric. a relation 𝑅 on 𝑆 by: 𝒂𝑹𝒃 ⇔ |𝒂| ≤ 𝒃.
(b) Symmetric and transitive but not Then, 𝑅 is
reflexive. (a) Reflexive but neither symmetric nor
(c) Reflexive and symmetric but not transitive.
transitive. (b) Symmetric but neither reflexive nor
(d) Reflexive, symmetric & transitive. transitive.
30. The relation ≥ on the set I of all integers is (c) Transitive but neither reflexive nor
(a) Symmetric and reflexive but not symmetric.
transitive. (d) None of these
34. Let S be the set of all real numbers. A 39. The intersection of two equivalence
relation 𝑅 has been defined on 𝑆 by relations is
𝑎𝑅𝑏 ⇔ |𝑎 − 𝑏| ≤ 1. Then, 𝑅 is (a) an equivalence relation.
(a) Reflexive and symmetric nut not (b) reflexive and symmetric but not
transitive. transitive.
(b) Reflexive and transitive but not (c) symmetric and transitive but not
symmetric. reflexive.
(c) Symmetric and transitive but not (d) reflexive and transitive but not
reflexive. symmetric
(d) An equivalence relation. 40. The union of two equivalence relation is:
35. Let S be the set of all real numbers. Then, (a) an equivalence relation.
the relation 𝑅 = {(𝑎, 𝑏): 1 + 𝑎𝑏 > 0} is (b) reflexive and symmetric but not
(a) Reflexive and symmetric but not transitive.
transitive. (c) symmetric and transitive but not
(b) Reflexive and transitive but not reflexive.
symmetric. (d) reflexive and transitive but not
(c) Symmetric and transitive but not symmetric.
reflexive. 41. For real numbers 𝑥 and 𝑦, we define
(d) None of these 𝒙𝑹𝒚 ⇔ 𝒙 − 𝒚 + √𝟐 is an irrational
36. A relation 𝑅 on 𝐴 reflexive, only when: number. Then, 𝑅 is:
(a) 𝑅 −1 = 𝑅 (a) Reflexive but neither symmetric for
(b) 𝑅𝑜𝑅 ⊆ 𝑅 transitive.
(c) 𝐼𝐴 ⊆ 𝑅, where 𝐼𝐴 is the identity (b) Reflexive and symmetric but not
relation on 𝐴. transitive.
(d) None of these (c) Reflexive and transitive but not
37. A relation 𝑅 on 𝐴 is symmetric, if: symmetric.
(a) 𝐼𝐴 ⊆ 𝑅 (d) An equivalence relation.
(b) 𝑅𝑜𝑅 ⊆ 𝑅 42. Let 𝑅 be a relation on 𝑁, defined by 𝑅 =
−1
(c) 𝑅 =𝑅 {𝑥, 𝑦): 2𝑥 + 𝑦 = 41} Then, R is
(d) None of these (a) Reflexive
38. A relation R on a set A is transitive, if (b) Symmetric
(a) 𝑅 −1 = 𝑅 (c) Transitive
(b) 𝐼𝐴 ⊆ 𝑅 (d) None of these
(c) 𝑅𝑜𝑅 ⊆ 𝑅
43. Let 𝑓: 𝑁 → 𝑁: 𝑓 (𝑥) = 2𝑥. Then, 𝑓 is:
(d) None of these
(a) One-one, onto 49. Let 𝑅 + be the set of all positive real
(b) One-one, into numbers. Then, 𝑓: 𝑅+ → 𝑅 + : 𝑓(𝑥) = 𝑒 𝑥 is
(c) Many-one, onto (a) Many-one, into
(d) Many-one, into (b) Many-one, onto
44. Let 𝑓: 𝑅 → 𝑅: 𝑓(𝑥) = 𝑥 2 . Then, 𝑓 is: (c) One-one, into
(a) One-one, onto (d) One-one, onto
(b) One-one, into 𝜋 𝜋
50. The function 𝑓: [− 2 , 2 ] → [−1,1]: 𝑓 (𝑥) =
(c) Many-one, onto
sin 𝑥, is
(d) Many-one, into
(a) One-one, into
45. Let 𝑓: 𝑅 → 𝑅: 𝑓(𝑥) = 𝑥 3 . Then, 𝑓 is
(b) One-one, onto
(a) One-one, onto
(c) Many-one, into
(b) One-one, into
(d) Many-one, onto
(c) Many-one, onto
51. The function 𝑓: 𝑅 → 𝑅: 𝑓(𝑥) = cos 𝑥 is:
(d) Many-one, into
(a) One-one, into
46. Let 𝐶 and 𝑅 denote the sets of all complex
(b) One-one, onto
numbers and all real numbers
(c) Many-one, into
respectively. Let 𝑓: 𝐶 → 𝑅: 𝑓 (𝑧) = |𝑧|.
(d) Many-one, onto
Then, 𝑓 is:
52. If 𝑓: 𝑄 → 𝑄: 𝑓 (𝑥) = 3𝑥 + 5, then
(a) One-one, onto
𝑓 −1 (𝑥) =?
(b) One-one, into (a) 3𝑥 − 5
(c) Many-one, into 1
(b) (3𝑥−5)
(d) Many-one, onto
1
(c) (𝑥 − 5)
47. Let 𝑓: 𝑁 → 𝑁: 𝑓 (𝑛) = 𝑛2 + 𝑛 + 1 Then, 3

𝑓 is (d) None of these

(a) One-one, onto 53. If 𝑓(𝑥) = (𝑥 2 − 1) and 𝑔(𝑥) = (3𝑥 + 1)

(b) One-one, into then (𝑔𝑜𝑓)(𝑥) =?

(c) Many-one, onto (a) 9𝑥 2 + 6𝑥

(d) Many-one, into (b) 3𝑥 2 − 1

48. Let 𝐴 = 𝑅 − {3} and 𝐵 = 𝑅 − {1}. Then, (c) 2𝑥 2 − 1


𝑥−2 (d) 3𝑥 2 − 2
𝑓: 𝐴 → 𝐵: 𝑓(𝑥) = 𝑥−3 is
54. If 𝑓(𝑥) = [𝑥] and 𝑔(𝑥) = |𝑥|, then
(a) Many-one, into 5 5
(𝑔𝑜𝑓) (− ) − (𝑓𝑜𝑔) (− ) =?
(b) Many-one, onto 3 3

(a) 0
(c) One-one, into
(b) 1
(d) One-one, onto
(c) 2
1
(d) 2
1
55. Let 𝑓(𝑥) = (1−𝑥), then (𝑓𝑜𝑓𝑜𝑓)(𝑥) =?
𝑥
(a)
(1−3𝑥)
1
(b) (1−3𝑥)

(c) 𝑥
(d) None of these
1 1
56. If 𝑓 (𝑥 + ) = 𝑥 2 + , 𝑥 ≠ 0, then
𝑥 𝑥2

𝑓 (𝑥) =?
(a) 𝑥 2
(b) (𝑥 2 − 1)
(c) (𝑥 2 − 2)
(d) None of these
57. If 𝑓 = {(1, 2), (3, 5), (4, 1)} and 𝑔 =
{(2, 3), (5, 1), (1, 3)}, then 𝑔𝑜𝑓 =?
(a) {(1, 3), (3, 1), (4, 3)}
(b) {(1, 5), (2, 5), (5, 2)}
(c) {(3, 1), (1, 3), (3, 4)}
(d) {(5, 1), (5, 2), (2, 5)}

58. Let 𝑓(𝑥) = √9 − 𝑥 2 . Then, Dom𝑓(𝑥) =?


(a) ] − ∞ − 3]
(b) [3, ∞]
(c) [−3, 3]
(d) ] − ∞, −3] ∪ [3, ∞]

Common questions

Powered by AI

The function f(x) = √(9-x^2) has the domain restricted to the interval [-3, 3], as the expression inside the square root must be non-negative. Outside of this interval, the value of (9-x^2) becomes negative, making the square root undefined in the real number system. Therefore, the domain is set as [−3, 3].

The function f(x) = x^2 is many-one and into because multiple values of x (specifically x and -x) map to the same value of x^2, making it not injective. It is 'into' because not all output values in the codomain R are reached, as only non-negative values are outputs of the square function .

The number of subsets of a set with n elements is calculated as 2^n. This is because each element in the set has two possibilities: it can either be included in a subset or not. Therefore, for n elements, there are 2^n possible combinations of these inclusions and exclusions, resulting in 2^n subsets .

The union of two equivalence relations is reflexive and symmetric but not necessarily transitive. This means while elements will hold reflexivity and symmetry due to the individual reflexive and symmetrical properties of the relations, transitivity cannot be guaranteed as the union may introduce pairs which do not satisfy the transitive property across the combined domains .

The relation R defined on natural numbers by 'a is a factor of b' is reflexive and transitive but not symmetric. It is reflexive because any number is a factor of itself. It is transitive because if a is a factor of b and b is a factor of c, then a is a factor of c. However, it is not symmetric because if a is a factor of b, it does not imply b is a factor of a unless a equals b .

The transitive property for the relation aRb defined by a - b being divisible by 3 is verified by showing that if a - b is divisible by 3, and b - c is divisible by 3, then a - c is also divisible by 3. This follows because when a ≡ b (mod 3) and b ≡ c (mod 3), it implies a ≡ c (mod 3), establishing transitivity .

Statement I, which suggests that every subset of an infinite set is infinite, is incorrect because subsets can be finite. For example, a subset of an infinite set can be a single element or even the empty set, both of which are finite .

The function f: N→N defined by f(x) = 3x + 5 is one-one and into, meaning it maps distinct elements of N into distinct elements of N without necessarily covering the entire natural number range, which is characteristic of an 'into' function. The inverse function f⁻¹(x) = (1/3)(x - 5) is derived by solving the equation for x, which reverts the effects of the function f on x .

The relation defined on the set of all lines in a plane where lines are parallel (aRb ⇔ a∥b) is an equivalence relation because it is reflexive, symmetric, and transitive. Reflexivity is satisfied since any line is parallel to itself. Symmetry is satisfied because if line a is parallel to line b, then line b is parallel to line a. Transitivity is satisfied because if line a is parallel to line b and line b is parallel to line c, then line a is parallel to line c .

The intersection of two finite sets is determined by the elements they have in common. If set A has elements m and set B has elements n, the intersection A ∩ B consists only of elements that are present in both sets. Mathematically, this is calculated by identifying all overlapping elements in sets A and B. If A has 70 elements, B has 60 elements, and A ∪ B has 110 elements, then A ∩ B has 70 + 60 - 110 = 20 elements .

You might also like