SHRI RAM JAYAM

SHRI RAGAVENDRA TUITION CENTRE Mob: 9444489211

Old No.38 / New No.79, A.P. Road, Choolai, Chennai 600 112 8072603428
Class 12 ─ Test No.06

Relation and Function

Q.No.1 If A = {5, 6, 7} and let R = {5, 5,) ; (6, 6); (7, 7); (5, 6); (6,5); (6, 7); (7, 6)} ; then R is

Options (a) (b) (c) (d)

Reflexive, Symmetric, Reflexive, Transitive An Equivalence

Symmetric but not Transitive but not but not symmetric relation

Transitive Reflexive

Q.No.2 Let R be a relation defined on Z as follows:

(a, b)  R  a2 + b2 = 25. Then Domain of R is

Options (a) (b) (c) (d)

{3, 4, 5} {0, 3, 4, 5} (0, 3, 4, 5) None of these

Q.No.3 The maximum number of equivalence relation on the set A = {1, 2, 3}

Options (a) (b) (c) (d)

1 2 3 5

Solution: Option: C – 5

R1 = { (1, 1); (2, 2); (3, 3) }

R2 = { (1, 1); (2, 2); (3, 3) ; (1, 2); (2, 1) }

R3 = { (1, 1); (2, 2); (3, 3) ; (1, 3); (3, 1) }

R4 = { (1, 1); (2, 2); (3, 3) ; (2, 3); (3, 2) }

R5 = { (1, 1); (2, 2); (3, 3) ; (1, 2); (2, 1); (1, 3); (3, 1); (2, 3); (3, 2) }

Q.No.4 Consider the set A = {1, 2} the relation on A which is symmetric but neither transitive nor

reflexive is

Options (a) (b) (c) (d)

{ (1, 1) (2, 2) } {} { (1, 2) } { (1, 2), (2, 1) }}

Q.No.5 Consider the set A = {d, e, f} and let R = { (d, d); (d, e); (e, d); (e, e)}; the R is

Options (a) (b) (c) (d)

Reflexive, Symmetric, Reflexive, Transitive An equivalence

Symmetric but not Transitive but not but not symmetric relation

transitive reflexive
 SHRI RAM JAYAM
SHRI RAGAVENDRA TUITION CENTRE Mob: 9444489211
Old No.38 / New No.79, A.P. Road, Choolai, Chennai 600 112 8072603428
Class 12 ─ Test No.06

Q.No.6 Let R be a Reflexive Relation on a finite set A having ‘’n’’ elements and let there be ‘’m’’ ordered

pairs in R, then

Options (a) (b) (c) (d)

m<n m>n m n None of these

Q.No.7 The number of elements of set A is 3. The number of possible relations that can be defined

on A is: [Note: Number of relations on set containing ‘’n’’ elements: 2𝑛 ]

2

Options (a) (b) (c) (d)

8 4 64 512

Q.No.8 The number of elements of set A is 3. The number of possible reflexive relations that can

be defined in A is [Note: Number of reflexive relations on set containing ‘’n’’ elements: 2𝑛 ]

2 −𝑛

Options (b) (b) (c) (d)

64 8 12 4

Q.No.9 The number of elements in set P is 4. The number of possible symmetric relations that can
𝑛(𝑛+1)
be defined on P is [Note: Number of reflexive relations on set containing ‘’n’’ elements: 2 2 ]

Options (a) (b) (c) (d)

16 32 512 1024

Q.No.10 N is the set of Natural numbers and R is a relation on N x N defined by

(a, b) R (C, d) if and only if a + d = b + c; then R is

Options (a) (b) (c) (d)

Only Reflexive Only Symmetric Only Transitive Equivalence

Q.No.11 The relation R defined on the set A = {1, 2, 3, 4, 5} by R = { (a,b) : |a2 ─ b2| > 16} is given

Options (a) (b) (c) (d)

{ (1,1) (2, 1) (3,1) { (2,2); (3,2); (4,2); { (3,3); (4, 3); (5,4); None of these

(4, 1) (2,3) } (2,4) } (3,4)}

 SHRI RAM JAYAM
SHRI RAGAVENDRA TUITION CENTRE Mob: 9444489211
Old No.38 / New No.79, A.P. Road, Choolai, Chennai 600 112 8072603428
Class 12 ─ Test No.06

Q.No.12 Let A = {p, q, r} ; the relation which is not an equivalence on A is

Options (a) (b) (c) (d)

{ (p,p); (q, q); (r, r) } { (p,p); (q,q); (r, r); { (p,p); (q q); (r, r); None of these

(p,q) ; (q, p) } (r, q); (q, r) }

Q.No.13 Let R be a relation on the N of natural numbers defined by aRb if and only if “a divides b”;

then R is

Options (a) (b) (c) (d)

Reflexive and Transitive and Equivalence Reflexive and

Symmetric Symmetric Transitive but not

symmetric

Q.No.14 Consider the set A = {4, 5}; the smallest equivalence relation

Options (a) (b) (c) (d)

{ (4, 4); (5, 5) } { (4, 4); (5, 5) (4, 5); {(4,4) ; (5, 5); (5,5)} None of these

(5, 5) }

Q.No.15 Let P = {1, 2, 3} then the number of Equivalence relation containing (1, 2)

Options (a) (b) (c) (d)

1 2 3 4

Solution: Option: C – 5

R1 = { (1, 1); (2, 2); (3, 3) ; (1, 2); (2, 1) }

R2 = { (1, 1); (2, 2); (3, 3) ; (1, 2); (2, 1); (1, 3); (3, 1); (2, 3); (3, 2) }

Q.No.16 Let A = {1, 2, 3} and consider the relation R = { (1, 1); (2, 2); (3, 3); (1, 2)} then R is

Options (a) (b) (c) (d)

Reflexive but not Reflexive but not Reflexive and Neither symmetric

symmetric transitive transitive nor transitive

 SHRI RAM JAYAM
SHRI RAGAVENDRA TUITION CENTRE Mob: 9444489211
Old No.38 / New No.79, A.P. Road, Choolai, Chennai 600 112 8072603428
Class 12 ─ Test No.06

Q.No.17 If a relation R on the set {1, 2, 3, 4} is defined by R = { (1, 2), (3, 4) } ; then R is

Options (a) (b) (c) (d)

Reflexive Transitive Symmetric None of these

Q.No.18 If the set A contains 4 elements and the set B contains 5 elements, then the number of one-

one and onto mappings from A to B is

Options (a) (b) (c) (d)

0 45 54 None of these

[Note: since n(A) < n(B) -------> No. of bijections = 0

Q.No.19 If A and B have 4 elements each then the number of bijective functions from A to B is

Options (a) (b) (c) (d)

0 24 42 None of these

[Note: Formula: 4!

Q.No.20 If A and B have 4 elements and 6 elements respectively, then the number of one-one function

from A to B is

Options (a) (b) (c) (d)

46 64 360 240

[Note: Formula: If n(A) = m ; n(B) = n; then number of one-one function: = nPm = 6P4

Answers:
1 A 2 C 3 D 4 D
5 D 6 C 7 D 8 A
9 D 10 D 11 D 12 D
13 D 14 C 15 B 16 C
17 B 18 A 19 C 20 C

==================================================================================
 SHRI RAM JAYAM
SHRI RAGAVENDRA TUITION CENTRE Mob: 9444489211
Old No.38 / New No.79, A.P. Road, Choolai, Chennai 600 112 8072603428
Class 12 ─ Test No.06