0% found this document useful (0 votes)
9 views5 pages

Chapter1 D30 Dec 2024

The document is an examination paper for a 12th-grade mathematics course focusing on relations and functions. It consists of multiple-choice questions, each carrying one mark, covering various properties of relations such as reflexivity, symmetry, and transitivity. The exam is structured into sections with a total of 50 marks and a duration of 3 hours.

Uploaded by

santhosh
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)
9 views5 pages

Chapter1 D30 Dec 2024

The document is an examination paper for a 12th-grade mathematics course focusing on relations and functions. It consists of multiple-choice questions, each carrying one mark, covering various properties of relations such as reflexivity, symmetry, and transitivity. The exam is structured into sections with a total of 50 marks and a duration of 3 hours.

Uploaded by

santhosh
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
You are on page 1/ 5

ASCENT SPEED CAMPUS

Relation and function Std 12 : Maths Date : 30/12/24


Total Marks : 50 chapter 1 Time : 3 hours
Section A
//X
• Choose correct answer from the given options. [Each carries 1 Mark] [50]

1. The relation S on set {1, 2, 3, 4, 5} is S = {(1, 1), (2, 2), (3, 3), (4, 4), (5, 5)}. Then S is ..........

D
(A) Only symmetric (B) Only reflexive
(C) Only transitive (D) Equivalence relation
2. If A = {1, 2, 3}, then the number of equivalence relation containing (1, 2) is ......
(A) 1 (B) 2 (C) 3 (D) 8

E
3. S is defined in Z by (x, y) Î S Û |x – y| £ 1. S is ....
(A) reflexive and transitive but not symmetric. (B) reflexive and symmetric but not transitive.
(C) symmetric and transitive but not reflexive. (D) an equivalence relation.

PE
4. If S is defined on R by (x, y) Î R Û xy ³ 0. Then S is ......
(A) an equivalence relation (B) reflexive only
(C) symmetric only (D) transitive only
5. Which of the following defined on Z is not an equivalence relation ?
(A) (x, y) Î S Û x ³ y (B) (x, y) Î S Û x = y
(C) (x, y) Î S Û x – y is a multiple of 3 (D) (x, y) Î S if |x – y| is even
TS
6. S is defined on N ´ N by ((a, b), (c, d)) Î S Û a + d = b + c ......
(A) S is reflexive, but not symmetric (B) S is reflexive and transitive only
(C) S is an equivalence relation (D) S is transitive only
7. The relation S on the set A = {5, 6, 7, 8} is defined as : S = {(5, 6), (6, 6), (5, 5), (8, 8), (5, 7), (7, 7),
(7, 6)}, then
(A) S is reflexive and symmetric but not transitive.
N

(B) S is reflexive and transitive but not symmetric.


(C) S is symmetric and transitive but not reflexive.
(D) S is equivalence relation.
CE

8. If A = {1, 2, 3} and R = {(1, 2), (2, 1), (2, 3)} then R is ...... relation.
(A) Reflexive (B) Symmetric (C) Transitive (D) None of these
9. If A = {2, 4, 6}, B = {7, 11} and R = {(a, b) / a Î A, b Î B and a – b is even} then out of the following
which is true ?
(A) {(2, 7), (4, 11)} (B) {(2, 11), (6, 7)} (C) f (D) {(4, 7), (6, 11)}
10. If R is a relation defined on the set N ´ N, (a, b) R (c, d) Û ad (b + c) = cb(a + d), then ......
AS

(A) only R is reflexive. (B) only R is symmetric.


(C) only R is transitive. (D) R is equivalence relation.
11. W is the set of all words of English alphabet. The relation R on W is defined as follow :
R = {(x, y) Î W ´ W, x and y has at least one letter common}. Then R is,
(A) reflexive and symmetric but not transitive. (B) reflexive, symmetric and transitive.
(C) reflexive and transitive but not symmetric. (D) transitive and symmetric but not reflexive.
12. The relation R in the set R of real numbers defined as aRb Û |a – b| £ 1. Then R is ......
(A) reflexive and symmetric (B) only symmetric
(C) only reflexive (D) equivalence relation
Wish You - All The Best
The relation R in the set R of real numbers defined as aRb Û |a – b| £ 1. Then R is ......
(A) reflexive and symmetric (B) only symmetric
(C) only reflexive (D) equivalence relation
13. A = {1, 2, 3, 4, ...} x, y Î A, x S y Û x + 2y = 10 then ......
(A) S = {(2, 4), (4, 3), (6, 2), (8, 1)} (B) Domain of S = {2, 4, 6, 8}
(C) Range of S = {1, 2, 3, 4} (D) At least one option is false.
14. X is a non empty set. The relation defined on P(X) is A S B Þ A Ç B ¹ f then S is a ..... relation.
(A) reflexive (B) symmetric (C) transitive (D) none of these
15. If R and S are two equivalence relation on a set A then,
(A) R È S is equivalence relation on a set A. (B) R Ç S is equivalence relation on a set A.

D
(C) R – S is equivalence relation on a set A. (D) none of these
16. Out of the following, which is not equivalence relation on Z ?
(A) a S b Û a + b is an even integer. (B) a S b Û a – b is an even integer.

E
(C) a S b Û a < b (D) a S b Û a = b
17. Which of the following relation in R is an equivalence relation ?
x
(A) x S y Û |x| = |y| (B) x S y Û x ³ y (C) x S y Û (D) x S y Û x < y

PE
y
18. R is a relation on N ´ N. Which of the following is not an equivalence relation in N ´ N ?
(A) (a, b) S (c, d) Û a + d = b + c (B) (a, b) S (c, d) Û ad = bc
(C) (a, b) S (c, d) Û ad (b + c) = bc (a + d) (D) (a, b) S (c, d) Û bc (b + c) = ad (a + d)
19. Let A be the non empty set of children in a family. The relation ‘x is a brother of y’ in A is
(A) reflexive (B) symmetric
TS
(C) transitive (D) an equivalence relation
20. S is a relation defined on Z by aSb Û ab ³ 0 then S is ......
(A) reflexive (B) symmetric (C) transitive (D) equivalence
21. 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
N

22. In order that a relation S defined in a non empty set A is an equivalence relation it is sufficient that S
(A) is reflexive. (B) is symmetric.
(C) is transitive. (D) posseses all the above three properties.
A relation S = {(a, b)|a ³ b, a, b Î R} then S is ......
CE

23.
(A) reflexive, symmetric and transitive. (B) reflexive, transitive but not symmetric.
(C) symmetric, transitive but not reflexive. (D) neither transitive nor reflexive but symmetric.
24. Let S be the relation over the set of integers such that mSn Û m is a multiple of n then S is ......
(A) reflexive and transitive (B) symmetric
(C) only transitive (D) an equivalence relation
AS

25. The relations S1, S2 and S3 are defined on Set A = {a, b, c}.
Section-A Section-B
(1) S1 = {(a, a), (a, b), (a, c), (A) Not equivalence.
(b, b), (b, c),
(c, a), (c, b), (c, c)}
(2) S2 = {(a, b), (b, a), (B) Only reflexive.
(a, c), (c, a)}
(3) S3 = {(a, b), (b, c), (C) Only symmetric.
(c, a)
(A) (1) ® (B) , (2) ® (C), (3) ® (A)Wish You - All The (1) ® (C), (2) ® (A), (3) ® (B)
(B)Best
(C) (1) ® (B), (2) ® (A), (3) ® (C) (D) (1) ® (C), (2) ® (B), (3) ® (A)
The relations S1, S2 and S3 are defined on Set A = {a, b, c}.
Section-A Section-B
(1) S1 = {(a, a), (a, b), (a, c), (A) Not equivalence.
(b, b), (b, c),
(c, a), (c, b), (c, c)}
(2) S2 = {(a, b), (b, a), (B) Only reflexive.
(a, c), (c, a)}
(3) S3 = {(a, b), (b, c), (C) Only symmetric.
(c, a)

D
(A) (1) ® (B) , (2) ® (C), (3) ® (A) (B) (1) ® (C), (2) ® (A), (3) ® (B)
(C) (1) ® (B), (2) ® (A), (3) ® (C) (D) (1) ® (C), (2) ® (B), (3) ® (A)
26. A = N the relation S is defined on A as
S = {(x, y)/x is divisible by y}. Then S is ......

E
(A) reflexive, transitive and not symmetric. (B) symmetric and transitive but not reflexive.
(C) reflexive and symmetric but not transitive. (D) equivalence relation.
27. A relation S on a set {1, 2, 3} is given by S = {1, 1), (2, 2), (3, 3)} is ......

PE
(A) equivalence relation. (B) only symmetric relation.
(C) only reflexive relation. (D) only transitive relation.

28. The relation on (11, 12, 13) to (8, 10, 12) is defined as xRy Þ y = x – 3 then R–1 = ......
(A) {(11, 8) (13, 10)} (B) {(8, 11) (10, 13)} (C) {(8, 11) (9, 12) (10, 13)} (D) none of these
29. R = {(x, y)/x2 + y2 = 1, x, y Î R}. Then relation R is ......
TS
(A) reflexive (B) symmetric (C) transitive (D) not symmetric
30. A relation R is defined on N ´ N as (a, b) R(c, d) Þ a + d = b + c then R is only ......
(A) reflexive (B) symmetric (C) transitive (D) equivalence
31. If A is the set of even natural numbers less than 8 and B is the set of prime numbers less than 7
then the number of relation from A to B is ......
(A) 29 (B) 92 (C) 32 (D) 29 – 1
N

32. Let R = {(1, 3), (4, 2), (2, 4), (2, 3), (3, 1)} is defined on a set A = {1, 2, 3, 4} then R is ......
(A) not symmetric (B) transitive (C) function (D) reflexive
33. Let R = {(3, 3), (6, 6), (9, 9), (12, 12), (6, 12), (3, 9) (3, 12) (3, 6)} is a relation defined on A = {3, 6,
9, 12}. The relation R is ......
CE

(A) only reflexive and symmetric. (B) equivalence relation.


(C) only reflexive. (D) only reflexive and transitive.
34. Let R be a real number line. In a plane R ´ R, S = {(x, y)/y = x + 1, 0 < x < 2} T = {(x, y) : x – y
is an integer}. Out of the following, which is true ?
(A) T is an equivalence relation but S is not equivalence on R.
(B) S and T are not equivalence on R.
AS

(C) S and T are equivalence on R.


(D) S is an equivalence but T is not equivalence on R.

ìæ m p ö
35. R = {(x, y) | x and y are real numbers and x = wy,where w is a rational number} S = íç , ÷ m,
îè n q ø
n, p, q are integers. n, q ¹ 0 and qm = pn} then
(A) R is equivalence but S is not equivalence. (B) R and S are not equivalence.
(C) S is equivalence but R is not equivalence. (D) R and S both are equivalence.
36. Let R be the set of real number.
Statement 1 : A = {(x, y) Î R ´ R / y – x is an integer} is an equivalence relation on R.
Statement 2 : B = {(x, y) Î R ´ R / x = Wish You -aAll
ay where The Bestnumber} is an equivalence relation on R.
is rational
(A) Statement 1 is true.
Let R be the set of real number.
Statement 1 : A = {(x, y) Î R ´ R / y – x is an integer} is an equivalence relation on R.
Statement 2 : B = {(x, y) Î R ´ R / x = ay where a is rational number} is an equivalence relation on R.
(A) Statement 1 is true.
(B) Statement 1 is false. Statement 2 is true.
(C) Statements 1 and 2 are true.
(D) Statements 1 and 2 are true. Statement 2 is not a true reason of statement 1.
37. If a set A has m elements and a set B has n elements then the number of relation from A to B is ..........
(A) 2m + n (B) 2mn (C) m + n (D) mn

D
38. A relation R on a finite set having n elements is reflexive. If R has m pairs then ..........
(A) m > n (B) m < n (C) m = n (D) None of these

39. x and y are real numbers. If xRy Û x – y + 5 is an irrational number then R is ....... relation.

E
(A) Reflexive (B) Symmetric (C) Transitive (D) None of these
40. A = {1, 2, 3, 4} and R = {(2, 2), (3, 3), (4, 4), (1, 2)} is relation on A. Then R is ....... relation.
(A) Reflexive (B) Symmetric (C) Transitive (D) None of these

PE
41. A relation R is from set A to B and a relation S is from set B to C. Then relation SOR is from ..........
(A) Set C to A (B) Set A to C (C) Does not exist (D) None of these
42. Relation R = {(4, 5), (1, 4), (4, 6), (7, 6), (3, 7)} then R–1OR = ..........
(A) {(1, 1), (4, 4), (7, 4), (4, 7), (7, 7)} (B) {(1, 1), (4, 4), (4, 7), (7, 4), (7, 7), (3, 3)}
(C) {(1, 5), (1, 6), (3, 6)} (D) None of these
43. A = [– 1, 1], B = [0, 1], C = [– 1, 0]
TS
S1 = {(x, y)|x2 + y2 = 1, x Î A, y Î A}
S2 = {(x, y)|x2 + y 2 = 1, x Î A, y Î B}
S3 = {(x, y)|x2 + y 2 = 1, x Î A, y Î C}
S4 = {(x, y)|x2 + y2 = 1, x Î B, y Î C} then the graph of ...... is not a function.
(A) S1 (B) S2 (C) S3 (D) S4

p p
44. f : éê- , ùú ® [– 1, 1] is a bijection, if ......
ë 2 2û
N

(A) f (x) = |x| (B) f (x) = sinx (C) f (x) = x2 (D) f (x) = cosx

45. f : R ® R, f (x) = x2 + 2x + 3 is ......


(A) a bijection. (B) one-one but not onto.
CE

(C) onto but not one-one. (D) many-one and not onto.
x
46. If f : R+ ® R – {1}, then f (x) = is ......
x +1
(A) one-one and onto. (B) one-one and not onto.
(C) not one-one and not onto. (D) onto but not one - one.
47. f : R ® Z, f (x) = [x] is ......
AS

(A) one-one and onto and has its inverse.


(B) many-one and not onto. Does not exist inverse.
(C) many-one and onto.
(D) one-one and not onto. Does not exist inverse.
48. f : R ® R, f (x) = x3 + 4 then f = ......
(A) one-one (B) onto (C) one-one and onto (D) none of these
49. A = [– 1, 1], B = [– 1, 1], C = [0, ฀)
R1 = {(x, y) Î A ´ B / x2 + y 2 = 1} and
R2 = {(x, y) Î A ´ C / x2 + y 2 = 1} then ......
(A) R1 is a function from A to B. Wish You - All The
(B)Best
R2 is a function from A to C.
(C) R1 is a onto function from A to B. (D) R2 is a onto function from A to C.
A = [– 1, 1], B = [– 1, 1], C = [0, ฀)
R1 = {(x, y) Î A ´ B / x2 + y 2 = 1} and
R2 = {(x, y) Î A ´ C / x2 + y 2 = 1} then ......
(A) R1 is a function from A to B. (B) R2 is a function from A to C.
(C) R1 is a onto function from A to B. (D) R2 is a onto function from A to C.

50. f : R ® R, f (x) = x4 then f is ......


(A) one-one and onto. (B) many-one and onto.
(C) one-one and not onto. (D) many-one and not onto.

E D
PE
N TS
CE
AS

Wish You - All The Best

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy