Font: Arial Size: 10 Spacing: Exactly 16

1. If is a relation in , then is
(A) Reflexive (B) Symmetric (C) Transitive (D) None of theseLe
Ans: (B)
Solution:
2. Let and the relation be defined on as follows:

Then, write minimum number of ordered pairs to be added in to make reflexive and
transitive.
(A) 1 (B) 2 (C) 3 (D) 4
Ans: (C)
Solution: We have given relation, . To make is reflexive we must add
and to . Also, to make is transitive we must add to .
Hence, minimum number of ordered pairs to be added are . i.e., 3
3. Let be the set of all real numbers. Then, the relation on is
(A) Reflexive and Symmetric but not transitive
(B) Reflexive and transitive but not symmetric
(C) Symmetric and transitive but not reflexive
(D) Reflexive, transitive and symmetric
Ans: (A)
Solution: Reflexive : As
is not reflexive.
Symmetric
is symmetric.
Transitive and need not imply .
Hence, is not transitive.
4. If and are symmetric relations (not disjoint) on a set , then the relation is
(A) Reflexive (B) Symmetric (C) Transitive (D) None of these
Ans: (B)
Solution: Given and are not disjoint, so there is atleast one ordered pair, say,
.
and .
As and are symmetric relations, we get
and
Hence, is symmetric.
5. Assume and (non-empty) relations in a set . Which of the relations given below is false?
(A) If and are transitive, then is transitive
(B) If and are transitive, then is transitive
(C) If and are symmetric, then is symmetric
(D) If and are reflexive, then is reflexive
Ans: (A)
Solution: Let
and
 Then and are both transitive but

is not transitive since and but .

6. Let a relation be defined as where and are real numbers, then is
(A) reflexive, symmetric and transitive
(B) reflexive, transitive but not symmetric
(C) symmetric, transitive but not reflexive
(D) neither transitive nor reflexive but symmetric
Ans: (B)
Solution: Given that
Reflexive : If is any real number, then , thus is reflexive.
Since, is not symmetric.
Transitive : If , then
Hence is transitive.
Hence is reflexive, transitive but not symmetric.
7. Let
where is the set of all natural numbers. Then the relation is
(A) reflexive, symmetric
(B) reflexive, transitive
(C) symmetric, transitive
(D) reflexive but neither symmetric nor transitive
Ans: (D)
Solution: Given,
Let
Then,
is reflexive.
Let
Then,
But
is not symmetric
Clearly, is not transitive.

8. If the relation defined on the set then is

(A) reflexive (B) symmetric (C) transitive (D) equivalence
Ans: (B)
Solution: Since , are not in
So, is not reflexive on .
Now,
So, is symmetric
Clearly,
So, is not transitive on .
9. A relation is defined on the set of integers as, . Which of the following
is true?
(A) is reflexive (B) is symmetric (C) is transitive (D) None of these
Ans: (B)
Solution:
10. Let be defined by . Then is
(A) both one one and onto (B) only one one
(C) only onto (D) neither one one nor onto
Ans: (D)
Solution: Given
Now,
and
Hence, is not one-one

Also,
Thus, for all and for .
This means that cannot be negative for any . So, is not onto.
11. A function from the set of natural numbers to integers is defined by

Then, is
(A) one-one but not onto (B) onto but not one-one
(C) one-one and onto both (D) neither one-one nor onto
Ans: (C)

Solution: Given that,

and , where is the set of natural numbers and is the set of integers.
Let and both are even.

Then,
Again, and both are odd.

Then
So, mapping is one-one.
Since, each negative integer is an image of even natural number and positive integer is an image
of odd natural number. So, mapping is onto. Hence, mapping is one-one and onto.

12. is a function from to , then is

(A) injective (B) surjective (C) bijective (D) none of these
Ans: (D)
Solution: We have,
Clearly, is not one-one as but .
 Also, is not onto as .

13. If and then is

(A) one-one and onto (B) one-one but not onto
(C) onto but not one-one (D) neither one-one nor onto
Ans: (B)
Solution:
14. If and , then the number of one-to-one functions from
into is
(A) 1340 (B) 1860 (C) 1430 (D) 1680
Ans: (D)
Solution: Number of one-one functions from to
where
15. If the set contains 5 elements and the set contains 6 elements, then the number of one-one
and onto mappings from to is
(A) 720 (B) 120 (C) 0 (D) None of these
Ans: (C)
Solution: As we know, if and are two non-empty finite sets containing and elements
respectively, then the number of one-one and onto mapping from to is

Given, and i.e.,

Number of mapping
16. Suppose that and
then is
(A) (B) (C) (D)
Ans: (B)
Solution: We have,

17. Which of the following options is correct?

(A) (B)
(C) (D)
Ans: (B)
Solution: In general, is one-one implies, is one-one and is onto implies that is
onto.

18. If , then is equal to

(A) (B) (C) (D)

Ans: (A)

Solution: We have
19. If , then find .
(A) (B) (C) (D)
Ans: (D)
Solution:

20. If , then is equal to

(A) 1 (B) 3 (C) 4 (D) 2
Ans: (D)

Solution:

Substituting in (i), we get

Substituting in (i)

21. Let be defined by , then is

(A) onto (B) not defined (C) one-one (D) bijective
Ans: (B)

Solution: Given function is

Since , but for , function is not defined
Also, we do not get any image for
is not defined in the given interval.
22. The set has 4 elements and the set has 5 elements then the number of injective mappings
that can be defined from to is
(A) 144 (B) 72 (C) 60 (D) 120
Ans: (D)
Solution: Since, set has 4 elements and set has 5 elements , then the number of injective
mappings from to
23. Let be defined by which is a bijective mapping then is given by

(A) (B) (C) (D)

Ans: (A)
 Solution: We have,
Since, is a bijective function
exists.
Let then there exist such that

24. If a relation on the set be defined by , then is

(A) Reflexive and transitive (B) Symmetric and transitive
(C) Only symmetric (D) Reflexive and symmetric
Ans: (B)
Solution: is symmetric and transitive but not reflexive as .
25. Let and , then is invertible in the domain

(A) (B) (C) (D)

Ans: (D)
Solution: We have and

Since, will be invertible in

i.e.,