1.

If A={x / x ∈ N , x≤5} , (D) Neither one-one nor onto

B={x : x ∈ Z , x 2 −5 x +6=0} 5. If a relation R on the set
the number of onto functions A={ 1 , 2, 3 } defined as
from A to B is
R={ (1 , 1 ), (2 , 2) , (3 , 3 ) } is
(A) 32
(A) Reflexive only
(B) 30
(B) Only symmetric
(C) 23
(C) Only transitive
(D) 2
(D) Equivalence

If R={( x , y ) : x , y ∈ Z , x +3 y ≤8 }
2. 2 2
6. If n(A)=3 and n(B)=4 Then the
is a relation on the set of number of onto functions from
integers then the range of R is B to A is
(A) {0, 1} (A) 36

(B) {–2, –1, 1, 2} (B) 81

(C) {–1, 0, 1} (C) 12

(D) {–2, –1, 0, 1, 2} (D) 64

3.
The function
f :R→
[ −1 1
,
2 2 ] 7. Let N denote the set of all
natural numbers. Define two
binary relations on N as
x R1 ={ ( x , y ) ∈ N × N : 2 x + y =10 }
f ( x )=
defined as 1+ x 2 R2 ={ ( x , y ) ∈ N × N : x+ 2 y =10 } .
(A) Injective but not surjective Then :

(B) Surjective but not injective (A) Range of R1 is {2, 4, 8}.

Neither injective nor (B) Range of R2 is {1, 2, 3, 4}.

(C)
surjective
Both R1 and R2 are
(D) Invertible (C)
symmetric relations.
Both R1 and R2 are
(D)
4. The function f : R → R defined transitive relations.
4
as f ( x )=x is 8. The number of one-one
(A) One –one functions from set A={1,2,3} to
itself is
(B) Onto (A) 6

(C) Bijective (B) 3

 (C) 9 1 10
(A) (B)
29 29
(D) 27 29
(C) (D) 29
9. Consider the following two
10
binary relations on the set

A ={a, b, c} : 12. f : ( 0 , ∞)→ (0 , ∞)

Let be a
R1={(c, a), (b, b), (a, c), (c, c), function defined by
(b, c), (a, a)} and 1
f ( x )=|1− |
x f
R2={(a, b), (b, a), (c, c), (c, a), then is
(a, a), (b, b), (a, c)}. Then :
(A) Not injective but surjective
both R1 and R2 are not
(A) (B) Injective only
symmetric
R1 is not symmetric but it Neither injective nor
(B) (C)
is transitive. surjective
R2 is symmetric but it is
(C) (D) Bijective
not transitive.
both R1 and R2 are
(D)
transitive.
13. Let R denotes the set of all
real numbers then the
10. Let f : A → B be a function
f : R →R
x−1 function be a
f ( x )= f ( x)=|x|
defined by x−2 where function defined by
A=R −{2} and B=R −{1} then f
then is
f is
3 y −1 (A) One –one only
(A) f −1 ( y )=
Invertible and y−1
(B) Onto only
2 y −1
(B) f −1 ( y )=
Invertible and y −1 (C) Both one –one and onto
2 y +1
(C) f −1 ( y )= (D) Neither one-one nor onto
Invertible and y−1
(D) Not invertible
14. Let [x] denotes the greatest
integer not greater than x then
11 If Let f : R → R be a function f : R →R
. x the function be a
f ( x )= 2
defined by x +1 then f ( x)=[ x ]
f (f (2 ))= function defined by
 f 17. f : R → R
then is be a function defined

(A) One –one only

f ( x )=2 x+6 f −1
by then is
(B) Onto only x
(A) −3
(C) Both one –one and onto 2

(D) Neither one-one nor onto (B) 2 x+ 6

(C) x−3

(D) 6 x +2
1
15. f ( x )= −tan
2 ( )
πx
2
, −1< x<1

g( x )=√3+4 x−x 2
18. f ( x )=8 x 3 , g( x )=x1 /3
Then domain of (f+g)(x) is If then
fog( x )=
−1
(A) [ , 1)
2 (A) 8 x
1
−1 (B) ( 8 x ) 3
(B) ( , 1]
2
(C) 2 x
(C) [ −1 3
,
2 2 ] (D) (8 x)
3

(D) (−1 , 1 )
19. The set ‘A’ having 6 distinct
elements. The number of
16. The set A has 4 elements and distinct functions from set A to
the Set B has 5 elements then A which are not bijective is
the number of injective
mappings from A to B is (A) 6 !−6
(A) 144 6
(B) 6 −1
(B) 72
6
(C) 6 −6 !
(C) 60

(D) 120 (D) 6 !

20. If a relation R on Set A={1,2,3} (D) 6
be defined by R={(1,1)} , then R
is
23. The minimum number of
(A) Reflexive and symmetric
elements that must be added to
(B) Reflexive and transitive the relation,
R = {(a, b), (b, c), (b, d)} on the
(C) Symmetric and transitive set {a, b, c, d} so that it is an
(D) Symmetric only equivalence relation, is
__________.

(A) 12

(B) 13

(C) 24

(D) 14

21. f : R →R 24. Let A={1, 2, 3, 4, 5, 6, 7}

Let be defined by

{
then the relation
x ; x>3
f ( x ) x 2 ; 1<x≤3
R={(x , y )∈ A× A : x+ y=7}
is
3 x ; x≤1
Reflexive but neither
(A)
f (−1 )+f (2 )+f (4 )= symmetric nor transitive
Then
Transitive but neither
(B)
(A) 9 reflexive nor symmetric

(B) 14 Symmetric but neither

(C)
reflexive nor transitive
(C) 5
(D) An equivalence relation
(D) 10

25 R
be a relation on R defined
22. The number of relations, on the . Let
set { 1,2,3 } containing (1,2) and R={(a,b):3a−3b+ √ 7 is irrational }
(2,3) which are reflexive and
transitive but not symmetric
Then R is
(A) 2
(A) An equivalence relation
(B) 4
Reflexive and symmetric
(B)
(C) 5 and transitive
 Reflexive and transitive but 29.
(C) The number of equivalence
not symmetric
relations on the set A={1,2,3}
Reflexive but neither
(D) which contains (1,2) is
symmetric nor transitive
(A) 2

26 Let R be a relation on N as a R b (B) 3

. if 2a+3b is multiple of 5 then R
(C) 4
is
(D) 5
(A) An equivalence relation

(B) Not reflexive

30.
The number of symmetric
Symmetric but not
(C) relations on the set A={1,2,3}
transitive

Transitive but not (A) 512

(D)
symmetric (B) 64

(C) 128
27 Let R={ (3, 3), (6, 6), (9, 9),
(D) 6
. (12, 12), (6, 12), (3, 9), (3, 12),
(3,6) }, be a relation on the set
A = { 3, 6, 9, 12 } is
30. If m and M are the least and
Reflexive & symmetric
(A)
only. greatest value of
(B) An equivalence relation. 2
m
( cos x ) −(sin x )
−1 −1 2
n
(C) Reflexive only. then is

(D) Reflexive and transitive. (A) 1

(B) 3
28. The relation R on the set
(C) -1
A={1,2,3} defined as
R={ (1, 1), (2, 2), (1, 2), (2,1) } is (D) -3
(A) Reflexive only

(B) Symmetric and transitive 31. The domain of the function

f ( x )=sin−1 √1−x
(C) Symmetric only

(D) Transitive only (A) [ 1 2 ]

 (B) [ 0 1 ] 34. If
sec 2 ( tan−1 x ) +cos ec 2 ( cot−1 x )=
(C) [ −1 1 ]

(D) None of these (A) 2

(B) 1+ x 2
32. The value of
(C) 2+ x 2

( (√)
tan cos
−1 1
5 2
−sin
−1
( ))
4
√ 17 (D) 2+2 x
2

√29
(A) 35. The simplest form of
3

(B) √3
tan−1 ( cos x−sin x
cos x+ sin x )
29
π
(C) 29 (A) 4
+x
3
3
(D) 29 (B) π −x
4
(C) π −x
3
π π
(D) +
4 2

33. The value of

[ {
cos−1 −cos −
13 π
6 }] is
36. ( x+1 )2 A Bx +C
= + 2
π 3
x +x x x +1
(A) 6 If then
sin−1 A +tan −1 B+sec −1 C=
(B) − π
6 π
(A) 6
(C) 5 π
6
2π (B) π
(D) 3 2
 (C) 5 π (A) 0≤ x≤1
6
(B) 0≤ x≤4
(D) 0
(C) 1≤x≤4

(D) 4≤ x ≤6
37. 2 cos
−1
x =sin −1
( 2 x √1−x 2 )
is
valid for values of x satisfying
π 1
(A) −1≤x ≤1 40. tan−1 x= −tan −1
4 3
If then x =
1
(B) ≤x≤1 1
√2 (A) 3
(C) 0≤ x≤1

1 (B) 1
(D) 0≤x≤ 2
√2
(C) 1
4
38. 3 x +1 A B 1
= + (D) 6
( x−1 )(x +3 ) x−1 x+3
If then

sin−1 ( )
A
B
=
41. a> b>0 ,
,
If
π
(A) 2
sec−1 ( a−b
a+b
)=2 sin −1
x

then x =
(B) π

√
3 a
(A) −
(C) π a+b
6
π
(D) 4
(B)
√ a
a+b

39. The domain of

(C) −
√ b
a+b
f ( x )=sin
−1
( ( ))
log 2
x
2
is
(D)
√ b
a+b
42. if 1+sin x +sin 2 x +sin 3 x+. . .. . 4 √5
(D)
. .. .. . .. upto∞ =4 +2 √ 3 9

then x =

π π
45. tan−1 ( )
1−x
1+ x
=2 tan −1 x

(A) 6 , 3 If

Then x =
(B) π , 5 π 1
3 6 (A) 3
(C) 5π
6 1
(B)
π 2π √3
(D) 3 , 3
(C) 1

(D) √3
(
43. sin 2sin−1
( √ ))
63
65
=

2π
45. Tan−1 x+2cot−1 x=
2 √126 3
(A) If
65
Then x =
(B) 4 √ 65
63 1
(A)
√3
(C) 8 √ 63
65 1
(B) −
4 √63 √3
(D)
65 (C) √3
(D) −√ 3
44.
The value of
(
sin 2cos−1 ( 3 ))
√5 =

2 √5 46. f ( x )=tan−1 x
(A)
3 The range of
other than principal range in
(B) √5 [0,2π ]
3 the interval

(C) 2 √ 5 (A) ( 0 , π )
9
 (B)
( ) π π
− ,
2 2
the system of linear constraints
are (0,0), (0,50), (30,0),(20,30)
(C)
(2, 2 )
π 3π the maximum value of
Z=4 x + y
the
is
objective function
(D) [ π 3π
,
2 2 ] (A)
210

(B) 150
−1
46. f ( x )=tan x
The range of (C)
other than principal range in 110
[0,2π ] (D)
the interval 120
(A) ( 0 , π )

(B)
(− π2 , π2 ) 49. The feasible region of LPP is
Z=3 x+ 9 y
shown in fig . if
(C)
(2, 2 )
π 3π
then the minimum value of z
occurs at

(D) [ π 3π
,
2 2 ]
47. f ( x )=sin−1 x
The derivative of
exists in the interval

(A) [ −1 , 1 ] (A) (5,5)

(B) (−1 , 1 ) (B) (0,10)

(C) R (C) (0,20)

(D) [ −
π π
,
2 2 ] 50.
(D) (15,15)
Z=x+ 4 y
For LPP ; maximize
subject to the constraints
x +2 y≤2 ; x+2 y≥8 ; x , y ≥0
48. The corner points of the
(A) Z max =4
feasible region determined by
 (B) Z max =8 (D) 5 x+4 y ≥20 ;
(C) Z max =16 x≥6 ;
(D) Has no feasible region. y≤3 ;x , y≥0
51. If an LPP admits optimal 53. The shaded region of the figure
solution at two consecutive is given by the in equations
vertices of a feasible region,
then
(A) the required optimal
solution is at the midpoint
of the line joining two
points.
(B) the optimal solution occurs
at every point on the line
joining these two points
(C) the LPP under (A) 14 x +5 y≥70 ; y≤14 ;
consideration is not x− y ≥5; x , y≥0
solvable
(D) the LPP under (B) 14 x +5 y≥70 ; y≤14 ;
consideration must be x− y ≤5; x , y≥0
reconstructed (C) 14 x +5 y≤70 ; y≤14 ;
52. The shaded region in the figure x− y ≥5; x , y≥0
is the solution set of the (D)
inequations 14 x +5 y≥70 ; y≥14 ;
x− y ≥5; x , y≥0

54. If an LPP admits optimal

solution at two consecutive
vertices of a feasible region,
then

(A) the required optimal

(A) 5 x+4 y ≥20 ; solution is at the midpoint
x≤6 ; of the line joining two
points.
y≥3 ;x , y≥0
(B) 5 x+4 y ≥20 ; (B) the optimal solution occurs
x≤6 ; at every point on the line
y≤3 ;x , y≥0 joining these two points
(C) 5 x+4 y ≤20 ; (C) the LPP under
x≤6 ; consideration is not
y≥3 ;x , y≥0 solvable

(D) the LPP under

consideration must be
reconstructed
55. Corner points of the feasible
region determined by the
system of linear constraints are
( 0, 3 ), ( 1, 1) and (3,0) let
Z= px+ qy p , q>0
where ,
condition on p and q so that
the minimum of Z occurs at (A) (0,5)
( 3, 0) and ( 1, 1 ) is
(B) (3,3)
(A) p=2q
(C) (5,0)
(B) q
p= (D) (3,2)
2
58. The objective function
(C) p=3 q Z=ax +by of an LPP has
maximum 42 at (4,6) and
(D) p= q minimum value at 19 at (3, 2)
which of the following is true

(A) a=9, b=1

(B) a=3,b=5

(C) a=5, b=2

56. Objective Function of a Linear
Programming Problem is (D) a=5,b=3
(A) Linear function

59. The feasible region of a linear

(B) Optimal function programming problem is shown
in figure given below
(C) Any polynomial

(D) Quadratic polynomial

57. The feasible region of an LPP is

Z=11 x+ 7 y
shown in figure. If
then the maximum value of Z
occurs at
 Which of the following are
possible constraints ?
(A) x +2 y ≥ 4 , x + y ≤3 , x , y ≥ 0

(B) x +2 y ≤ 4 , x + y ≤3 , x , y ≥ 0

(C) x +2 y ≥ 4 , x + y ≥ 3 , x , y ≥ 0

(D) x +2 y ≥ 4 , x + y ≤3 , x , y ≤ 0

60. The corner points of the

feasible region of a linear
programming problem are
(0,4) ,(8,0) and (20/3,4/3) if
Z=30 x+24 y is the objective
function, then Z max − Z min =
is equal to
(A) 40

(B) 96

(C) 120

(D) 136