Tan Cot 2, 2 As X X Sofx
Tan Cot 2, 2 As X X Sofx
Tan Cot 2, 2 As X X Sofx
SECTION – A
By definition, R is symmetric.
5. (d) As, |adj A| = |A|2 = 265, so |A| = 16 or – 16
Thus, the sum of all possible values of |A| is zero. 1
6. (d) 0 1
x 2 5 y O 1
1 0
5 y x 2 O 0 0
On Comparing, y = - 5, x = 2, so x + y = - 3
7. (b) a 0 0 a 2 0 0
L et , A 0 b 0 A2 0 b2 0 1
0 0 c 0 0 c 2
a 0 0 a 2 0 0
As A A 0
2
b 0 0 b2 0
0 0 c 0 0 c 2
So, a = 0 or – 1, similarly b and c can take 2 values (0 and -1)
Thus, total number of possible matrices are 2 x 2 x 2 = 8
8. (d)
1 1 a
b 3 4
2 , 1
3 c
d 5 6
a b 2 5
c d 3 3
Thus , a c b d 5 5 3 3
9. (c) As, (A - AT )T = - (A – AT)
So, (A – AT) is not Symmetric matrix, 1
10. (d) |2AT| = 23|AT| = 8 |A| = 24
1
11. (d) x a
x b c
x x x x
a b c
y= a a a , 1
x x x
a b c
x x x b c
x x xb c
x xb xc
dy
Thus, y 1 0
dx
12. (c) By definition, 3 x 5 = a x b = c x d, thus a = c = 3 and b = d = 5
Thus, ac + bd = 9 + 25 = 34 1
1
dy dy dy
3x 3( x
2 2
+2 xy ) 3 y 2 x y
dx dx dx
dy y 6 xy 3x 2
dx 3 y 2 3x 2 x
15. (d) y = x3 ⇒ Slope of tangent = 3x2 at the point (2, 8)
Slope of tangent at the point (2, 8) is 3(4) = 12 1
SECTION – B
21. (b) 2
cos 1 x cos 1 y (sin 1 x sin 1 y ) 1
3 3
22. (a) As f(x) = f(y) ⇒ x = y, so f(x) is one-one function
And as range of f is R = co-domain, so f is onto function 1
2A + I = A – 1 1
35. (a) Since f(x) = 2sin 2x, Value of sin 2x lies between – 1 to 1,
so maximum value of f(x) is 2 1
36. (c) At (1, 4), 13 = a(1) + 4 ⇒ a = 9
1
37. (b) As, (L1,L1) R (Every line coincides at all points with itself)
So, R is not Reflexive. 1
As, (L1,L2) ɛ R implies (L2,L1) ɛ R, So, R is Symmetric.
As, (L1,L2) ɛ R, (L2,L3) ɛ R does not implies (L1,L3) ɛ R, So, R is
not Transitive. (For
( lines L1,
example In case of two parallel line
L3 intersect by a line L2)
38. (c) As for 3 and 4 from set X we have same image c in set Y,
so f is not one-one
one one function. Further element d has no 1
pre-image
image in set X, so f is not onto function.
39. (a) The feasible region for an LPP is always a convex polygon
1
(In
In general, the feasible region of a Linear Programming
Problem (LPP) is the intersection of the half-spaces
half paces which
are defined by the hyper planes. From this observation, we
can conclude that the feasible region of an LPP PP is always a
convex polygon)
40. (b) y ' = ex , slope of tangent at (0, 1) = 1
Thus, equation of tangent is y – 1 = x which intersect the 1
x-axis at x = -1,
1, so the required point is ( - 1, 0)
SECTION – C
41. (a) From the graph, The feasible region lies in First Quadrant
1
42. (b)
For
or f(x) = cos x, f’ (x) = - sin x which is negative on (0, )
2 1
So, cos x is decreasing function on (0, )
2
43. (d) f ‘ (x) = cos x – a, so f (x) is decreasing on x ɛ R, when
a ɛ [1, ∞)) because cos x ≤ 1 1
44. (c) In a linear programming problem, If the feasible region is
bounded then objective function Z = px + qy has 1
Maximum and minimum value both both.
45. (d) 6 x 8
A | A | 12 x 24 0 x 2 1
3 2
46. (c) C
kv 2 , so 48 k (16) 2 .Thus,16k 3
t 1
47. (d) C 3 2
v 1200 1
t 16
3 3 1000 1000
C v 2t 1200t v 2 ( ) 1200( )
16 16 v v
375 1200000
C v .
2 v
48. (b) dC 375 1200000
0 v 80 1
dv 2 v2
d 2C
positive at v 80
dv 2
49. (a) The fuel cost (In Rs.)for the train to travel 1000km at the
375 375 1
most economical speed is C v (80) 15000
2 2
50. (b) The total cost of the train to travel 1000km at the most
economical speed is 1
375 1200000 1200000
C v 15000
2 v 80
C 30000