MQP Ans 01
MQP Ans 01
(iv) (b) p u (: p u q)
(v) (d) y eax
(vi) (b) 2, 3
1 4x 3
1. (C) (i) R {0} (ii) e c (iii) 2.
4
2. (A) (i)
p q :p :q : p u: q p;q (: p u : q) ; (p ; q)
T T F F F T T
T F F T F F T
F T T F F T T
F F T T T T T
All the entries in the last column of the above truth table are T.
(: p u : q) ; (p ; q) is a tautology.
(ii) (A B)(A B) A2 B2
A2 AB BA B2 A2 B2
AB BA 0
AB BA
α 3 2 β α 1 a βα 1 a β α 3 2 β
2 4 b 0 b 0 2 4
α 3 2b 3a 0 β α 3 2a 2 4a β
2 4b 2a 0 3b 0 2b 0
α 3 2b 3a β α 3 2a 2 4a β
2 4b 2a 3b 2b
SOLUTION TO NAVNEET PRACTICE PAPERS : STD. XII 1
By equality of matrices
3 2b 3 2a ... (1)
3a 2 4a ... (2)
2 4b 3b ... (3)
2a 2b ... (4)
2
From (2), 7a 2 a
7
2
From (3), 7b 2 b
7
These values of a and b also satisfy equations (1) and (4).
2 2
Hence, a and b .
7 7
3 3
(iii) x2 log x dx (log x) · x2 dx
1 1
3
3 d
[(log x) x2dx]1 s [ (log x) x2dx ] dx
dx
1
3
x3 3 1 x3
[ (log x) ( )] dx
3 1 1 x 3
1 13
[x3 log x]31 x2dx
3 31
3
1 1 x3
[27 log 3 0] [ ] ... [B log 1 0 ]
3 3 3 1
1
9 log 3 (27 1)
9
26
9 log 3 .
9
2. (B) (i) Let x cm and y cm be the length and breadth of the rectangle.
Then its perimeter is 2 (x y) 36
x y 18 y 18 x
Area of the rectangle xy x (18 x)
Let f (x) x (18 x) 18x x2
d
Then f (x) (18x x2)
dx
18 1 2x 18 2x
d
and f (x) (18 2x)
dx
021 2
1 log x
(ii) Let I s dx
x (3 log x)(2 3 log x)
1 log x 1
s · dx
(3 log x)(2 3 log x) x
1
Put log x t dx dt
x
1t
Is dt
(3 t)(2 3t)
1t A B
Let
(3 t)(2 3t) 3 t 2 3t
2 1
χ 7 7 δ
( ) ( )
I dt
s
3t 2 3t
2 1 1 1
s dt s dt
7 3t 7 2 3t
(iii) Let the cost of 1 Economics book, 1 Cooperation book and 1 Account book be ` x,
` y and ` z respectively.
Then, from the given information
xyz 420
x 2y z 480
x 3y 2z 600
These equations can be written in matrix form as :
1 1 1 x 420
χ 1 2 1 δ χ y δ χ 480 δ
1 3 2 z 600
By R2 R1 and R3 R1, we get
1 1 1 x 420
χ 0 1 0 δ χ y δ χ 60 δ
0 2 1 z 180
xyz 420
χ 0 y 0 δ χ 60 δ
0 2y z 180
By equality of matrices
x y z 420 ... (1)
y 60
2y z 180 ... (2)
Substituting y 60 in (2), we get
2(60) z 180
z 180 120 60
Substituting y 60, z 60 in (1), we get
x 60 60 420
x 420 120 300
Hence, the cost of each Economics book is ` 300, each Cooperation book is ` 60
and each Account book is ` 60.
1 x
3. (A) (i) y ( 1
x
)
1 x 1
log y log ( 1 ) x log ( 1 )
x x
(ii)
By the symmetry of the ellipse, its area is equal to 4 times the area of the region
OABO. Clearly for this region, the limits of integration are 0 and 2.
From the equation of the ellipse,
y2 x2 4 x2
1
25 4 4
25
y2 (4 x2)
4
In the first quadrant, y 0
5
y gh4 x2
2
area of ellipse 4 (area of the region OABO)
2
4 y dx
0
2 5
4 gh4 x2 dx
0 2
x a2 x
... [ gha2 x2 dx gha2 x2 sin1 ( ) ]
2 2 a
2 0
10 [{ ef4 42 sin1 (1) } { ef4 02 sin1(0)}]
2 2
a b dy a b a b dy
·
x y dx x y x y dx
b a b dy a b a
y x y dx x y x
( )
bx ay dy bx ay
y (x y) dx x (x y)
[ ]
1 dy 1
·
y dx x
dy y
.
dx x
log P kt c
Initially, i.e. when t 0, P 30,000
log 30000 k 0 c
c log 30000
1 4
k log ( )
40 3
P t 4
equation (1) becomes, log ( ) log ( )
30000 40 3
P 4 t/40
log ( ) log ( )
30000 3
P 4 t/40
( )
30000 3
4 t /40
P 30000 .
3
( )
x
(iii) Cyclical.
(ii) Let the number of gadgets A produced by the firm be x and the number of gadgets
B produced by the firm be y.
The profit on the sale of A is ` 30 per unit and on the sale of B is ` 20 per unit.
the total profit is z 30x 20y.
This is a linear function which is to be maximized.
Hence, it is the objective function.
Estimation of Y when X 5 :
Regression of Y on X is y a byx · x
4
Now, byx r · y 0.6 0.8
x 3
byx 0.8
a y byx ·x
12 0.8 (10) 12 8 4
a4
Hence, the regression equation of Y on X is
y 4 0.8x, i.e. y 0.8x 4
Putting x 5, we get
y 0.8 (5) 4
y44 y8
Hence, the estimate of y is 8 when x 5.
7x (510000 5x)
6420
100 100
7x 510000 5x 642000
2x 132000 x 66000
(ii)
Time (in hours)
Jobs
Lathe (A) Surface grinder (B)
I 4 3
II 1 2
III 5 4
IV 2 3
V 5 6
II
II IV
II IV I
II IV III I
II IV V III I
1
p probability of correct answer
3
1 2
q1p1
3 3
1
Now, X : B ( 5, )
3
P (X x) nCx px qnx
1 x 2 5x
5Cx (
3 3
) ( )
P[X 4]
P[X4]P[X5]
1 4 2 1 5 2 0
5C4 ( 5
) ( ) C5 ( ) ( )
3 3 3 3
1 4 2 1 5
5 ( ) ( )1( )
3 3 3
10 1 11
.
243 243 243
1 e3 [1 3]
1 0.0497 (4)
1 0.1988 0.8012
Hence, P [ X 2 ] is 0.8012.
(ii) We first draw the lines AB, CD and EF whose equations are 3x y27, x y 21,
x 2y30 respectively.
Points on Points on
Line Equation Sign Region
the X-axis the Y-axis
AB 3x y27 A ( 9 , 0) B (0, 27) non-origin side of the line AB
CD x y 21 C (21, 0) D (0, 21) non-origin side of the line CD
EF x 2y30 E (30, 0) F (0, 15) non-origin side of the line EF
Xx 1 2 3 4 5 6
1 1 1 1 1 1
P [Xx]
6 6 6 6 6 6
X xi pi P [X xi] xi pi xi2 pi xi pi xi
1 1 1
1
6 6 6
1 2 4
2
6 6 6
1 3 9
3
6 6 6
1 4 16
4
6 6 6
1 5 25
5
6 6 6
1 6 36
6
6 6 6
21 91
Total 1 xi pi xi2 pi
6 6
21 7
E (X) xi pi
6 2
E (X) 3.5
Var (X) xi2pi ( xi pi )2
91 21 2
( )
6 6
91 441
6 36
546 441
36
105 35
36 12
35
Var (X)
12
35
Hence, E (X) 3.5, Var (X) .
12
Infant
u=
Year Mortality Trend
(t – 1995) u2 uxt
t Rate value
xt 5
1980 10 –3 9 – 30 8.999
1985 07 –2 4 – 14 7.428
1990 05 –1 1 – 05 5.857
1995 04 00 0 0 00 4.286
2000 03 01 1 0 03 2.714
2005 01 02 4 0 02 1.144
2010 00 03 9 0 00 0.427
– 05
Total xt = 30 u=0 u2 = 28 – 49
uxt = – 44
Base Current
year year
Commodity
p0 q0 p1 q1 p1 q0 p0 q0 p1 q1 p0 q1
A 2 10 2 5 20 20 10 10
B 2 5 x 2 5x 10 2x 4
p1 q0 p0 q0 p1 q1 p0 q1
20 5x 30 10 2x 14
P01(L) P01(P)
p1q0 p1q1
100 100.
p0q0 p0q1
20 5x 10 2x
100 100
30 14
20 5x 10 2x
30 14
280 70x 300 60x
10x 20
x 2 .
(ii) Step 1 : Subtract the smallest element in each row from every element of it. New
assignment matrix is obtained as follows :
Jobs I II III IV
P 6 0 8 4
Q 4 3 2 0
R 0 2 4 5
S 4 2 0 6
Step 2 : Subtract the smallest element in each column from every element of it.
New assignment matrix is obtained as above, because each column in it contains
one zero.
Step 4 : From step 3, as the minimum number of straight lines required to cover
all zeros in the assignment matrix equals the number of rows/columns. Optimal
solution has reached.
Examine the rows one by one starting with the first row with exactly one zero is
found. Mark the zero by enclosing it in (), indicating assignment of the job.
Cross all the zeros in the same column.
This step is shown in the following table :
Processing cost (in ` )
Machines
Jobs I II III IV
P 6 0 8 4
Q 4 3 2 0
R 0 2 4 5
S 4 2 0 6
Step 5 : It is observed that all the zeros are assigned and each row and each column
contains exactly one assignment. Hence, the optimal (minimum) assignment
schedule is
Jobs Machines Processing cost (in ` )
P II 25
Q IV 21
R I 19
S III 34