LENKA ACADEMY
DAILY PRACTICE SHEET
1. Let A = {1, 2, 3}. The total number of distinct relations that can be defined over A is
(a) 2 9 (b) 6
(c) 8 (d) None of these
2. Let X = {1, 2, 3, 4, 5} and Y = {1, 3, 5, 7, 9} . Which of the following is/are relations from X to Y
(a) R1 = {(x, y)| y = 2 + x, x X , y Y }
(b) R2 = {(1,1),(2,1),(3, 3),(4, 3),(5, 5)}
(c) R3 = {(1,1),(1, 3)(3, 5),(3, 7),(5, 7)}
(d) R4 = {(1, 3),(2, 5),(2, 4),(7, 9)}
3. Given two finite sets A and B such that n(A) = 2, n(B) = 3. Then total number of relations from A to B is
(a) 4 (b) 8
(c) 64 (d) None of these
4. The relation R defined on the set of natural numbers as {(a, b) : a differs from b by 3}, is given by
(a) {(1, 4, (2, 5), (3, 6),.....} (b){(4, 1), (5, 2), (6, 3),.....}
(c) {(1, 3), (2, 6), (3, 9),..} (d) None of these
5. The relation R is defined on the set of natural numbers as {(a, b) : a = 2b}. Then R −1 is given by
(a) {(2, 1), (4, 2), (6, 3).....} (b){(1, 2), (2, 4), (3, 6)....}
(c) R −1 is not defined (d) None of these
6. The relation R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1, 3)} on set A = {1, 2, 3} is
(a) Reflexive but not symmetric
(b) Reflexive but not transitive
(c) Symmetric and Transitive
(d) Neither symmetric nor transitive
7. The relation “less than” in the set of natural numbers is
[UPSEAT 1994, 98, 99; AMU 1999]
(a) Only symmetric (b) Only transitive
(c) Only reflexive (d) Equivalence relation
8. Let P = {(x, y)| x + y = 1, x, y R} . Then P is
2 2
(a) Reflexive (b) Symmetric
(c) Transitive (d) Anti-symmetric
9. Let R be an equivalence relation on a finite set A having n elements. Then the number of ordered pairs in R is
(a) Less than n
(b) Greater than or equal to n
(c) Less than or equal to n
(d) None of these
10. For real numbers x and y, we write xRy x − y + 2 is an irrational number. Then the relation R is
(a) Reflexive (b) Symmetric
(c) Transitive (d) None of these
11. Let X be a family of sets and R be a relation on X defined by ‘A is disjoint from B’. Then R is
(a) Reflexive (b) Symmetric
(c) Anti-symmetric (d) Transitive
12. If R is a relation from a set A to a set B and S is a relation from B to a set C, then the relation SoR
(a) Is from A to C (b) Is from C to A
(c) Does not exist (d) None of these
LENKA ACADEMY
DAILY PRACTICE SHEET
13. If R A B and S B C be two relations, then (SoR )−1 =
(a) S −1oR −1 (b) R −1oS −1
(c) SoR (d) RoS
14. If R be a relation < from A = {1,2, 3, 4} to B = {1, 3, 5} i.e., (a, b) R a b, then RoR −1 is
(a) {(1, 3), (1, 5), (2, 3), (2, 5), (3, 5), (4, 5)}
(b) {(3, 1) (5, 1), (3, 2), (5, 2), (5, 3), (5, 4)}
(c) {(3, 3), (3, 5), (5, 3), (5, 5)}
(d) {(3, 3) (3, 4), (4, 5)}
15. A relation from P to Q is
(a) A universal set of P × Q
(b) P × Q
(c) An equivalent set of P × Q
(d) A subset of P × Q
16. Let A = {a, b, c} and B = {1, 2}. Consider a relation R defined from set A to set B. Then R is equal to set
[Kurukshetra CEE 1995]
(a) A (b) B
(c) A × B (d) B × A
17. Let n(A) = n. Then the number of all relations on A is
(a) 2 n (b) 2(n)!
2
(c) 2n (d) None of these
18. If R is a relation from a finite set A having m elements to a finite set B having n elements, then the number of
relations from A to B is
(a) 2mn (b) 2 mn − 1
(c) 2mn (d) m n
19. Let R be a reflexive relation on a finite set A having n-elements, and let there be m ordered pairs in R. Then
(a) m n (b) m n
(c) m = n (d) None of these
20. The relation R defined on the set A = {1, 2, 3, 4, 5} by
R = {(x, y) : | x 2 − y 2 | 16} is given by
(a) {(1, 1), (2, 1), (3, 1), (4, 1), (2, 3)}
(b) {(2, 2), (3, 2), (4, 2), (2, 4)}
(c) {(3, 3), (3, 4), (5, 4), (4, 3), (3, 1)}
(d) None of these
21. A relation R is defined from {2, 3, 4, 5} to {3, 6, 7, 10} by xRy x is relatively prime to y. Then domain of R
is
(a) {2, 3, 5} (b) {3, 5}
(c) {2, 3, 4} (d) {2, 3, 4, 5}
22. Let R be a relation on N defined by x + 2y = 8 . The domain of R is
(a) {2, 4, 8} (b) {2, 4, 6, 8}
(c) {2, 4, 6} (d) {1, 2, 3, 4}
23. If R = {(x, y)| x, y Z, x + y 4} is a relation in Z, then domain of R is
2 2
(a) {0, 1, 2} (b) {0, – 1, – 2}
LENKA ACADEMY
DAILY PRACTICE SHEET
(c) {– 2, – 1, 0, 1, 2} (d) None of these
24. R is a relation from {11, 12, 13} to {8, 10, 12} defined by y = x − 3 . Then R −1 is
(a) {(8, 11), (10, 13)} (b) {(11, 18), (13, 10)}
(c) {(10, 13), (8, 11)} (d) None of these
25. Let A = {1, 2, 3}, B = {1, 3, 5}. If relation R from A to B is given by R ={(1, 3), (2, 5), (3, 3)}. Then R −1 is
(a) {(3, 3), (3, 1), (5, 2)} (b) {(1, 3), (2, 5), (3, 3)}
(c) {(1, 3), (5, 2)} (d) None of these
26. Let R be a reflexive relation on a set A and I be the identity relation on A. Then
(a) R I (b) I R
(c) R = I (d) None of these
27. Let A = {1, 2, 3, 4} and R be a relation in A given by R = {(1, 1), (2, 2), (3, 3), (4, 4), (1, 2), (2, 1), (3, 1), (1,
3)}.
Then R is
(a) Reflexive (b) Symmetric
(c) Transitive (d) An equivalence relation
28. An integer m is said to be related to another integer n if m is a multiple of n. Then the relation is
(a) Reflexive and symmetric (b)Reflexive and transitive
(c) Symmetric and transitive (d) Equivalence relation
29. The relation R defined in N as aRb b is divisible by a is
(a) Reflexive but not symmetric
(b) Symmetric but not transitive
(c) Symmetric and transitive
(d) None of these
30. Let R be a relation on a set A such that R = R −1 , then R is
(a) Reflexive (b) Symmetric
(c) Transitive (d) None of these
31. Let R = {(a, a)} be a relation on a set A. Then R is
(a) Symmetric
(b) Antisymmetric
(c) Symmetric and antisymmetric
(d) Neither symmetric nor anti-symmetric
32. The relation "is subset of" on the power set P(A) of a set A is
(a) Symmetric (b) Anti-symmetric
(c) Equivalency relation (d) None of these
33. The relation R defined on a set A is antisymmetric if (a, b) R (b, a) R for
(a) Every (a, b) R (b) No (a, b) R
(c) No (a, b), a b, R (d) None of these
34. In the set A = {1, 2, 3, 4, 5}, a relation R is defined by
R = {(x, y)| x, y A and x < y}. Then R is
(a) Reflexive (b) Symmetric
(c) Transitive (d) None of these
35. Let A be the non-void set of the children in a family. The relation x is a brother of y on A is
(a) Reflexive (b) Symmetric
(c) Transitive (d) None of these
LENKA ACADEMY
DAILY PRACTICE SHEET
36. Let A = {1, 2, 3, 4} and let R= {(2, 2), (3, 3), (4, 4), (1, 2)} be a relation on A. Then R is
(a) Reflexive (b) Symmetric
(c) Transitive (d) None of these
37. The void relation on a set A is
(a) Reflexive (b) Symmetric and transitive
(c) Reflexive and symmetric (d)Reflexive and transitive
38. Let R1 be a relation defined by R1 = {(a, b)| a b, a, b R} . Then R1 is [UPSEAT 1999]
(a) An equivalence relation on R
(b) Reflexive, transitive but not symmetric
(c) Symmetric, Transitive but not reflexive
(d) Neither transitive not reflexive but symmetric
39. Which one of the following relations on R is an equivalence relation
(a) a R1 b | a | =| b | (b) aR2b a b
(c) aR3b a divides b (d) aR4 b a b
40. If R is an equivalence relation on a set A, then R −1 is
(a) Reflexive only
(b) Symmetric but not transitive
(c) Equivalence
(d) None of these
41. R is a relation over the set of real numbers and it is given by nm 0 . Then R is
(a) Symmetric and transitive (b)Reflexive and symmetric
(c) A partial order relation (d) An equivalence relation
42. In order that a relation R defined on a non-empty set A is an equivalence relation, it is sufficient, if R
[Karnataka CET 1990]
(a) Is reflexive
(b) Is symmetric
(c) Is transitive
(d) Possesses all the above three properties
43. The relation "congruence modulo m" is
(a) Reflexive only (b) Transitive only
(c) Symmetric only (d) An equivalence relation
44. Solution set of x 3 (mod 7), p Z, is given by
(a) {3} (b) {7 p − 3 : p Z}
(c) {7 p + 3 : p Z} (d) None of these
45. Let R and S be two equivalence relations on a set A. Then
(a) R S is an equivalence relation on A
(b) R S is an equivalence relation on A
(c) R − S is an equivalence relation on A
(d) None of these
46. Let R and S be two relations on a set A. Then
(a) R and S are transitive, then R S is also transitive
(b) R and S are transitive, then R S is also transitive
LENKA ACADEMY
DAILY PRACTICE SHEET
(c) R and S are reflexive, then R S is also reflexive
(d) R and S are symmetric then R S is also symmetric
47. Let R = {(1, 3), (2, 2), (3, 2)} and S = {(2, 1), (3, 2), (2, 3)} be two relations on set A = {1, 2, 3}. Then RoS =
(a) {(1, 3), (2, 2), (3, 2), (2, 1), (2, 3)}
(b) {(3, 2), (1, 3)}
(c) {(2, 3), (3, 2), (2, 2)}
(d) {(2, 3), (3, 2)}
48. Let L denote the set of all straight lines in a plane. Let a relation R be defined by R ⊥ ,, L . Then R
is
(a) Reflexive (b) Symmetric
(c) Transitive (d) None of these
49. Let R be a relation over the set N × N and it is defined by (a, b)R(c, d) a + d = b + c. Then R is
(a) Reflexive only (b) Symmetric only
(c) Transitive only (d) An equivalence relation
50. Let n be a fixed positive integer. Define a relation R on the set Z of integers by, aRb n | a − b |. Then R is
(a) Reflexive (b) Symmetric
(c) Transitive (d) Equivalence
