SOLUTION : PRACTICE PAPER 5

SECTION – I
1. (A) (i) (a) 3  4
(ii) (a) ( p) v ( q u  r )

log 1 1c
1 4  3x
(iii) (c)

24 4  3x
(iv) (b) 0

y2
(v) (b) 

log y

(vi) (d) ( ,  ) .
1

4

1. (B) (i) True

(ii) False

(iii) False.

1. (C) (i)  1
1
(ii)

x
(iii) x  ect.

6 3 4 1
2. (A) (i) [2 0 3 ] {3 [  1 2 ]2[ 1 0 ] }  [x y ]
5 4 3 4
18 9 8 2
 [2 0 3 ] { [  3 6 ]  [ 2 0 ] }  [x y ]
15 12 6 8
10 7
 [2 0 3 ] [  1 6 ]  [x y ]
9 4
 [20  0  27 14  0  12 ]  [x y ]
 [47 26 ]  [x y ]
By equality of matrices, we get
x  47 and y  26.

(ii) (a) T
 he given statement can be written as :
If it is night, then all the stars are shining.
Let p : It is night.
q : All the stars are shining.
Then the symbolic form of the given statement is p  q.

MATHEMATICS & STATISTICS 1

 Since  (p  q)  p u  q, the negation of given statement is :
‘ It is night and all the stars are not shining. ’
(b) T
 he negation of the given statement is :
‘ U n N, such that n  1 O 0. ’
(c) T  he negation of given statement is :
‘ All continuous functions are not differentiable. ’


(iii) Let I  s
1
5
dx
x(x  1)

s
x4
dx
x5(x5  1)
Put x5  t. Then 5x4 dx  dt
dt
 x4 dx 
5

 I s
1 dt
·
t (t  1) 5

1 (t  1)  t
   s dt
5 t (t  1)

 s(  ) dt
1 1 1
5 t t1

 [  s dt  s dt ]
1 1 1
5 t t1

1
 [log  t   log  t  1  ]  c
5

 log 1 1  c  log 1 5 1  c.
1 t 1 x5
5 t1 5 x 1

2. (B) (i)  Y

X' O A (5, 0) X

Y'

By the symmetry of the circle, its area is equal to 4 times the area of the region
OABO. Clearly for this region the limits of integration are 0 and 5.
From the equation of the circle, y2  25  x2.

2 NAVNEET PRACTICE PAPERS : STANDARD XII ( COMMERCE )

 In the first quadrant y  0
 y  gh25  x2
 area of the circle  4 (area of region OABO)

 4  y dx  4  gh25  x2 dx
5 5

0 0

 4 [ gh25  x2  sin1 ( ) ]
x 25 x 5
2 2 5 0

... [ � gha2  x2 dx  gha2  x2  sin1 ( ) ]

x a2 x
  2 2 a

 4 [{ ef25  25  sin1(1)} { ef25  0  sin1 (0) } ]

5 25 0 25
2 2 2 2

... [� sin1 (1)  , sin 1 (0)  0.]

25  
4 · ·  25 sq units. 
2 2 2

dx
(ii) y ( 1  log x )  x log x  0
dy
1  log x dy
 dx   0
x log x y
 s dx  s
1  log x dy
 c1 ... (1)
x log x y
Put x log x  t.

Then [ x · (log x )  (log x) · (x) ] dx  dt

d d
dx dx

 [  (log x)(1) ] dx  dt
x
 ( 1  log x) dx  dt
x

 s dx  s  log  t   log  x log x

1  log x dt
x log x t
 from (1), the general solution is
  log  x log x   log  y   log c , where c1  log c

 log 1 1  log c 
x log x x log x
c
y y
 x log x  cy
This is the general solution.
Now, y  e2 , when x  e
 e log e  c·e2    1  c·e ... [B log e  1 ]
1
 c
e
 the particular solution is x log x  ( ) y
1
e
 y  ex log x.


MATHEMATICS & STATISTICS 3

 (iii) (a) The negation of ( p  q ) v ( p  r ) is :
 [( p  q ) v ( p  r ) ]   ( p  q ) u  ( p  r ) ... [Negation of disjunction]
 (p u  q) u ( p u  r) ... [Negation of implication]

(b) The negation of ( p  q ) v ( q   r) is :
 [( p  q ) v ( q   r)]   ( p  q ) u  ( q   r)
 ... [Negation of disjunction]
 [(p u  q) v ( q u  p) ] u [ q u  ( r)]
 ... [Negation of biconditional and implication]
 [(p u  q) v ( q u  p) ] u ( q u r) ... [Negation of negation]

3. (A) (i) The given equations can be written in the matrix form as :

C2 3  1 D  C y D  C 11 D
1 2 1 x 8
3 1 2 z 5
By R2  2R1 and R3  3R1, we get

  C 0  1  3 D  C y D  C  5 D
1 2 1 x 8
0 7 5 z  19
By R3  7R2, we get

  C 0  1  3 D C y D  C  5 D
1 2 1 x 8
0 0 16 z 16

 C 0  y  3z D  C  5 D
x  2y  z 8
0  0  16z 16
By equality of matrices
x  2y  z  8    ... (1)
 y  3z   5    ... (2)
   
16z  16  ... (3)
From (3), z  1
Substituting z  1 in (2), we get
 y  3   5    y  2
Substituting y  2, z  1 in (1), we get
x  4  1  8    x3
Hence, x  3, y  2, z  1 is the required solution.


(ii) Let I  s
3x  2
dx
(x  1)2(x  3)
3x  2 A B C
Let 2
  2

(x  1) (x  3) x  1 (x  1) x3

4 NAVNEET PRACTICE PAPERS : STANDARD XII ( COMMERCE )

  3x  2  A(x  1)(x  3)  B(x  3)  C (x  1)2 ... (1)
Put x  1  0, i.e. x   1 in (1), we get
3(  1)  2  A(0)(2)  B (2)  C (0)
5
  5  2B   B  
2
Put x  3  0, i.e. x   3 in (1), we get
3(  3)  2  A(  2)(0)  B(0)  C(4)
11
  11  4C   C  
4
Put x  0 in (1), we get
3(0)  2  A(1)(3)  B(3)  C(1)
  2  3A  3B  C
5 11
But B   and C  
2 4
  2  3A  3 ( ) 
5 11
2 4
15 11  8  30  11 33
 3A   2    
2 4 4 4
11
 A
4
( ) ( ) ( )
11 5 11
3x  2 4 2 4
 2   2
(x  1) (x  3) x1 (x  1) (x  3)

s C 4 D
( ) ( ) ( )
11 5 11
4 2
 I  2 dx
x1 (x  1) x3

s dx  s(x  1)2 dx  s
11 1 5 11 1
 dx
4 x1 2 4 x3
11 5 (x  1)1 11
 log x  1  ·  log x  3  c
4 2 1 4
 log 1 1
11 x1 5
 c.
4 x  3 2 (x  1)

(iii) Let P (x1, y1) be the point on the curve y  x2  5, where the tangent is parallel to
the line 4x  y  4  0.
Differentiating y  x2  5 w.r.t. x, we get
dy d 2
 (x  5)  2x  0  2x
dx dx
dy
 ( )  2x1  slope of the tangent at (x1, y1)
dx at (x1, y1)

MATHEMATICS & STATISTICS 5

 Let m1  2x1
4
The slope of the line 4x  y  4  0 is m2  4
1
Since the tangent at P (x1, y1) is parallel to the line 4x  y  4  0, m1  m2
 2x1  4    x1  2
Since (x1, y1) lies on the curve y  x2  5, y1  x12  5
 y1  (2)2  5  9 ... [B x1  2 ]
 the coordinates of the point are (2, 9) and the slope of the tangent  m1  m2  4.
 the equation of the tangent at (2, 9) is
y  9  4 (x  2)
 y  9  4x  8
 4x  y  1  0
Hence, the equation of required tangent is 4x  y  1  0.

3. (B) (i) Let x be the number of bacteria at time t.

Then the rate of increase of x is proportional to x.
dx
 x
dt
dx
  kx, where k is a constant
dt
dx
  k dt
x
On integrating, we get

s
1
dx  k  dt
x
 log x  kt  c
Initially, i.e. when t  0, x  N
 log N  k  0  c   c  log N
 log x  kt  log N
 log x  log N  kt

 log ( )  kt
x
... (1)
N
Since the number doubles in 3 hours, i.e. when t  3, x  2N

 log ( )  3k
2N
N
1
 k  log 2
3

 (1) becomes, log ( )  log 2

x t
N 3

6 NAVNEET PRACTICE PAPERS : STANDARD XII ( COMMERCE )

 When x  4N, we get

log ( )  log 2
4N t
N 3
 3 log 4  t log 2

 log 43  log 2t

 2t  43  26

 t6

Hence, the number of bacteria will be 4N in 6 hours.



(ii) (a) Let R be the total revenue.

Then R  P·x  (240  x) x

 R  240x  x2
dR d
  (240x  x2)
dx dx
 240  1  2x  240  2x
dR
R is increasing, if  0
dx
i.e. if 240  2x  0
i.e. if 240  2x
i.e. if x  120
Hence, the revenue is increasing, if x  120.

(b) Profit   R  C
   (240x  x2)  (180  4x)
 240x  x2  180  4x
 236x  x2  180
d d
  (236x  x2  180)
dx dx
 236  1  2x  0  236  2x
d
Profit is increasing, if 0
dx
i.e. if 236  2x  0
i.e. if 236  2x
i.e. if x  118
Hence, the profit is increasing, if x  118.

MATHEMATICS & STATISTICS 7

 1 1

3. (C) (i)  Let I  s log (  1) dx s log ( ) dx

1 1x
... (1)
x x
0 0

 s log c d dx
1
1 (1  x)

1x
0

 I  s log ( ) dx
x
... (2)
1x
0

Adding (1) and (2), we get

1

2I  s log [ ] dx
1x x

x 1x
0

1 1
  log 1 dx   0 dx
0 0

 0.


(ii) x  2at2, y  at4

Differentiating x and y w.r.t. t, we get
dx d d 2
 ( 2at2)  2a (t )  2a  2t
dt dt dt
dx
 4at
dt
dy d d 4
and  (at4)  a (t )  a  4t3
dt dt dt
dy
  4at3
dt
dy (dy/dt ) 4at3
    t2
dx ( dx / dt ) 4at
d2y d 2 d dt
 2  (t )  (t2) 
dx dx dt dx

d 2 1 1 d2y 1
 (t )   2t    2  .
( )
dt dx 4at dx 2a
dt

SECTION – II
4. (A) (i) (c) If LPP has two optimum solutions, then it has infinitely many solutions.
(ii) (b) 5
(iii) (b) Del Credere Agent

8 NAVNEET PRACTICE PAPERS : STANDARD XII ( COMMERCE )

 (iv) (c) both (a) and (b)
(v) (a) Binomial distribution
4
(vi) (b) .
3

4. (B) (i) True  (ii) True  (iii) False.

4. (C) (i) Centre of gravity

(ii) Zero
(iii) first.

5. (A) (i) We prepare the following table for calculation :

(x  x) (y  y )
x y (x  x) (y  y ) (x  x )2
x2 y 3
1 2 1 1 1 1
2 1 0 2 0 0
3 6 1 3 3 1
&x  6 &y  9 &(x  x)  0 &(y  y)  0 & (x  x)(y  y)  4 & (x  x)2  2
Here, n  3
&x 6 &y 9
x   2; y    3
n 3 n 3
Regression line of Y on X :
y  a  byx · x
& (x  x)(y  y) 4
byx   2
& (x  x)2 2
 byx  2
a  y  byx · x
Putting y  3, byx  2, x  2, we get
a  3  2(2)  3  4   1   
 a 1
Hence, regression line of Y on X is
   y   1  2x
 y  2x  1
Putting x  4 in y  2x  1, we get
y  2 (4)  1
 y  8  1     y  7.
Hence, most likely value of y when x  4 is 7.


MATHEMATICS & STATISTICS 9

 (ii) 
Base Current
Commodity Year Year q0q1 efq0q1 p1efq0q1 p0efq0q1
p0 q0 p1 q1
L 4 16 3 19 304 17.44 52.32 69.76
M 6 16 8 14 224 14.97 119.76 89.82
N 8 28 7 32 896 29.93 209.51 239.44
Total – – – – – – &p1efq0q1  381.59 &p0efq0q1  399.02

Walsch’s Price Index Number :

&p1efq0q1 381.59
&p0efq0q1
P01(W)   100   100  0.9563  100  95.63
399.02

Hence, Walsch’s index number is 95.63.


(iii) We construct the following table to obtain 3-yearly moving averages for the data in
Problem 10 :

Production 3-yearly 3-yearly

Year
(in ’000) moving moving averages
t
xt total Trend value

1991 1 – –
1992 0 4 1.3333
1993 3 11 3.6667
1994 8 21 7.0000
1995 10 22 7.3333
1996 4 19 6.3333
1997 5 17 5.6667
1998 8 – –

5. (B) (i) Processing time (in minutes)

Jobs
Machine A Machine B
I 12 7
II 6 8
III 5 9
IV 11 4
V 5 7
VI 7 8
VII 6 3

10 NAVNEET PRACTICE PAPERS : STANDARD XII ( COMMERCE )

Here, Min. (A, B)  3, which corresponds to Machine B.
Therefore, job VII is processed at the last.

VII

Now, problem reduces to jobs I to VI.

Here, Min. (A, B)  4, which corresponds to Machine B.
Therefore, job IV is processed at the last next to job VII.

IV VII

The problem now reduces to jobs I to III, V and VI.

Here, Min. (A, B)  5, which corresponds to Machine A.
Therefore, job III is processed at the first and job V is processed next to job III.

III V IV VII

The problem now reduces to jobs I, II and VI.

Here, Min. (A, B)  6, which corresponds to machine A.
Therefore, job II is processed at first next to job V.

III V II IV VII

The problem now reduces to job I and job VI.

Here, Min. (A, B)7, which corresponds to both machines A and B.
Therefore, job VI is processed at first next to job II and job I is processed next to
job VI and we get the optimal sequence of jobs as follows :

III V II VI I IV VII

Total elapsed time is obtained as follows :

Job Machine A Machine B Idle time
Sequence Time in Time out Time in Time out for Machine B
III 0 5 5 14 5
V 5 10 14 21 0
II 10 16 21 29 0
VI 16 23 29 33 0
I 23 35 37 44 0
IV 35 46 46 50 2
VII 46 52 52 55 2
Total idle time for Machine B 9

MATHEMATICS & STATISTICS 11

 Total elapsed time T  55 minutes
Idle time for machine A
 T  Total processing time for machine A
 55  52
 3 minutes
Idle time for machine B  9 minutes

(ii) Base Current
Group Year Year p1q0 p0q0
p0 q0 p1
Food 150 13 160 2080 1950
Clothing and Fuel 170 18 150 2700 3060
Lighting 175 10 190 1900 1750
House rent 200 12 210 2520 2400
Miscellaneous 210 15 260 3900 3150
&p1q0 &p0q0
Total
 13100  12310
Cost of Living Index Number :
&p q 13100
CLI  1 0  100   100
&p0q0 12310
 1.0642  100
 106.42.

(iii) Total sales  ` 51,000.
Let cash sales be ` x.
Then credit sales  `(51000  x)
4 x
Commission at 4% on cash sales of ` x  x  `
100 25
6
Commission at 6% on credit sales of ` (51000  x)  (51000  x) 
100

 ` ( 3060  )
6x
100

Total commission paid to the agent  ` ( )

x 6x
 3060 
25 100

 ` ( 3060  )
4x  6x
100

 ` ( 3060  )
2x
100

12 NAVNEET PRACTICE PAPERS : STANDARD XII ( COMMERCE )

 But the agent claims a total commission of ` 2700.
2x
 2700  3060 
100
2x
  3060  2700
100
x
  360
50
 x  50  360
 x  ` 18000
The sales made by the agent for cash is ` 18,000.
 the sales made by the agent on credit
 `(51000  18000)  ` 33,000.
The sales made by the agent for cash is ` 18,000 and on credit ` 33,000.

6. (A) (i) Here, n  9. We transform year t to u by taking u  t  1979.

We construct the following table for calculation :

Year Number of u
u2 uxt
t deaths xt  t1979
1975 0 4 16 0
1976 6 3 9  18
1977 3 2 4  6
1978 8 1 1  8
1979 2   0 0     0
1980 9   1 1     9
1981 4   2 4     8
1982 5   3 9   15
1983 10   4 16   40
    72
Total & xt  47 & u0 & u2  60  32
& uxt  40

The equation of trend line is xt  a  bu.

The normal equations are,
& xt  na  b & u  ... (1)
& uxt  a & u  b & u2   ... (2)
Here, n  9, & xt  47, & u  0, & u2  60, & uxt  40.
Putting these values in normal equations, we get
47  9a  b(0)   ... (3)
40  a(0)  b(60)  ... (4)

MATHEMATICS & STATISTICS 13

 From equation (3), we get
47
a   5.2222
9
From equation (4), we get
40
b   0.6667
60
Putting a  5.2222 and b  0.6667 in xt  a  bu, we get the equation of trend
line as xt  5.2222  0.6667 u, where u  ( t  1979).

(ii) We prepare the following table to find E (X) and Var (X) :

Xx P (Xx)
xi pi xi2 pixi pi  xi
xi pi

1 1 1
1 
5 5 5

0 2 0 0
5

1 2 2 2
5 5 5
1 3
Total 1  xi pi   xi2 pi 
5 5

1
E (X) & xi pi 
5
Var (X) E (X2)  [ E (X) ]2

 & xi2 pi  ( )
1 2
5
3 1 15  1 14
   
5 25 25 25
1 14
Hence, E (X)  Var (X)  .
5 25

(iii) Since the assignment problem is of maximization, subtract all the elements of
matrix from the maximum element 60 of the matrix:

Work assigned (Profit in ’000 `)

Salesman
I II III
A 4 1 0
B 3 2 2
C 2 4 3
Subtract the smallest element of each row from the elements of that row.

14 NAVNEET PRACTICE PAPERS : STANDARD XII ( COMMERCE )

 Work assigned (Profit in ’000 `)
Salesman
I II III
A 4 1 0
B 1 0 0
C 0 2 1
Since the smallest element of each column is zero, matrix remains unchanged.
Now, the number of lines covering all zeros is 3, which is equal to the order of
matrix, i.e. 3. Therefore, optimum solution of the problem is achieved, which is as
follows :

Work assigned (Profit in ’000 `)

Salesman
I II III
A 4 1 0
B 1 0 0
C 0 2 1
Assignment is made as follows :
Profit
Salesman Work assigned
(in ’000 `)
A III 60
B II 58
C I 58

Total maximum profit  ` 176,000.

6. (B) (i) Given : Two regression lines : x  4y  5, 16y  x  64

Means of X and Y :
  x  4y  5 Put y  5.75 in x  4y  5
 x  16y  64  x  4 (5.75)  5
     12y  69  x  5  23
69  x  28
 y
12
 5.75

Hence, x  28, y  5.75

MATHEMATICS & STATISTICS 15

 Coefficient of correlation :
  x  4y  5 16y  x  64
 x  4y  5  16y  x  64
 bxy  4 1
 y x4
16
1
 byx 
16

Now, r   efbyx . bxy

 r   ij
1
4
16

 r   ij
1
4
1
 r   0.5 ... [B byx and bxy are positive]
2

(ii) Let the book value of the stock be ` x.

Insured value of the stock  ` ( x  )`

80 4x
100 5
Stock of ` 80,000 completely destroyed in a fire and
balance `( x  80000) is reduced to 20 %.
 damage to balance stock
20
 `(x  80000) 
100
1
 `( x  80000 ) 
5

 total loss  ` [ 80000  ]

x  80000
5

 [ 80000   16000 ]
x
5

 ` [  64000 ]
x
5
Compensation (claim) received under the policy is ` 67,200.
Insured Value
Claim   Loss
Value of the stock

( )
4x
 [  64000 ]
5 x
 67200 
x 5

 67200  [  64000 ]
4 x
5 5

16 NAVNEET PRACTICE PAPERS : STANDARD XII ( COMMERCE )

 5 x
 67200    64000
4 5
x
 84000  64000 
5
x
 20000 
5
 x  20000  5
 x  100000
The value of the stock is ` 1,00,000.

6. (C) (i) Let x be the packages of bulbs, y be the packages of tubes.

Then x  0, y  0
x requires 1 hour on M1
y requires 2 hours on M1
M1 is available for 10 hours.

 x  2y  10
x requires 3 hours on M2, y requires 4 hours on M2
M2 is available for 12 hours

 3x  4y O 12
Profit on x is ` 13.50,  Profit on y is ` 55.

 total profit z  13.5x  55y

Hence, the mathematical formulation of given LPP is :

Maximise z  13.5x  55y , subject to

x  2y O 10 , 3x  4y O 12 , x  0 , y  0


(ii) Here n  4 , x  No. of defective items

Probability of defective item p  0.1     q  0.9

P [X  x ]  4
Cx (0.1)x (0.9)4x

Probability that not more than one defective item  P [X O 1 ]

 P [X  0]  P [X  1]

 4C0 (0.1)0  (0.9)4  4C1(0.1)1  (0.9)3

 1  (0.9)4  4  (0.1) (0.9)3  1.3 (0.9)3.

MATHEMATICS & STATISTICS 17