VELAMMAL VIDHYASHRAM, SURAPET
Marking Scheme –PRE
BOARD-2 Class XII 2024 - 25
MATHEMATICS STANDARD (Code No.041)
TIME: 3 hours MAX.MARKS: 80
1 (a) symmetric 1
2 (d) 5 1
3 (b) -2π/5 1
4 (d) 1 1
5 (b) -12 1
6 (d) 512 1
7 (b) ±3 1
8 (c) 108 1
9 (b) 3/4t 1
10 d)75 1
11 (d) 10√3 cm2/s 1
12 (c)4 1
13 2x
(c)𝑙𝑜𝑔2 1
14 (b) π/4 1
15 (b) 32/3 1
16 (d) undefined 1
17 (a) 3, 2, -2 1
18 (d) none of the above 1
19 (a) Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation 1
of Assertion (A).
20 (d) Assertion (A) is false but Reason (R) is true. 1
21
OR
1
1
22 Given that, A = {1, 2, 3} and R = {1, 1), (2, 2), (3, 3),(4, 4), (1, 2), (1, 3), (3, 2)}.
Now,
R is reflexive ∵ (1,1),(2,2),(3,3),(4,4) ∈ R
R is not symmetric ∵ (1,2),(1,3),(3,2) ∈ R but (2,1),(3,1),(2,3) ∉ R 1
R is transitive ∵ (1,3) ∈ R and (3,2) ∈ R ⇒ (1,2) ∈ R
1
23
OR
1
24 We have, f(x) = x3 – 3x2 + 6x – 100 ...(i)
Differentiating (i) w.r.t. x, we get
f′(x) = 3x2 – 6x + 6 = 3(x2 – 2x + 1) + 3 = 3(x – 1)2 + 3 > 0 1
∵ For all values of x, (x – 1)2 is always positive
∴ f′(x) > 0
1
So, f(x) is an increasing function on R.
25
26 X 0 1 2
P(x) 144 24 1
169
169 169
For random variable……1.5mark
Corresponding probability distribution values . …………3mark
26 2
E(X)=169 = 13……………..(1/2 mark)
OR
1
1
1
27
27 (OR)
𝑑𝑥
= 𝑎(1 − 𝑐𝑜𝑠𝑡)……………..1m
𝑑𝑡
𝑑𝑦
= −𝑎𝑠𝑖𝑛𝑡……………………1m
𝑑𝑡
𝑑𝑦 𝑡
= tan ( )……………………1m
𝑑𝑥 2
𝑑𝑥
28 =∫
(9𝑥 2 + 6𝑥 + 1 + 9)
𝑑𝑥
=∫
((3𝑥 + 1)2 + 32 )
1
1 3𝑥+1
=9 𝑡𝑎𝑛 −1 ( 3 ) +𝑐
1
1
29
OR
1
1
30
31
2
1
32
Correct figure with shading….. 1m
The points of intersection are (4, 4) and (-4, -4)………..1m
4 4√2
Required area = ∫0 𝑥𝑑𝑥 + ∫4 √32 − 𝑥 2 𝑑𝑥………1m
Integrating and sub limit ………….1m
Final value 4π………………………..1m
(OR) 1½
Finding point of intersection of lines ….(each ½ m)
Correct figure with shading…..
1m
1
33 1
1
2
1
2
34 In order to show R is an equivalence relation we need to show R is Reflexive, Symmetric and
Transitive.
Given that, R be the relation in N × N defined by (a, b) R (c, d) if a + d = b + c for (a, b), (c, d) in
N × N.
R is Reflexive if (a, b) R (a, b) for (a, b) in N × N Let (a, b) R (a, b)
⇒ a + b = b + a which is true since addition is commutative on N. 1
⇒ R is reflexive. R is Symmetric if (a, b) R (c, d)
⇒ (c, d) R (a, b) for (a, b), (c, d) in N × N Let (a, b) R (c, d)
⇒a+d=b+c
⇒ b + c = a + d ⇒ c + b = d + a [since addition is commutative on N]
⇒ (c, d) R (a, b)
⇒ R is symmetric. R is Transitive if (a, b) R (c, d) and (c, d) R (e, f) 2
⇒ (a, b) R (e, f) for (a, b), (c, d),(e, f) in N × N Let (a, b) R (c, d) and (c, d) R (e, f)
⇒ a + d = b + c and c + f = d + e
⇒ (a + d) – (d + e) = (b + c) – (c + f)
⇒a-e=b-f
⇒a+f=b+e
⇒ (a, b) R (e, f) 2
⇒ R is transitive. Hence, R is an equivalence relation.
OR
2
1
35
36 (𝑖 )6(𝑥 + 1)2 (𝑥 − 3)2 (𝑥 − 1) 1
(ii) -1, 1, 3 1
(iii)(1,3) ∪ (3, ∞) (OR ) (−∞, −1) ∪ (−1,1) 2
37 (i) 200 and 400 2
(ii)200+300+400=900 2
38 1
