SMK TUNKU AMPUAN DURAH, SEREMBAN

TRIAL STPM 2013 - TERM 3

MATHEMATICS M (950/3)



MARK SCHEME









Zadoc2013

SECTION A
1. (a) Given x = number of textbook.
Total cost, C(x) = Fixed cost + Variable cost
= Fixed cost + (Cost per unit)x
= 80 000 + 3x B1

(b) Total revenue, R(x) = (Price per unit)(x)
R(x) = px B1

For break-even, C(x) = R(x)
80 000 + 3(4000) = p(4000) M1
p = RM23 A1 [4]


2. (a) Loan amount , P = 230 000 10%(230 000) = 207 000 B1
Interest rate per period,
0.075
0.00625
12
r
i
m
= = =
Number of payments, n = 12 30 = 360 B1

Monthly payment
( ) 1 1
n
i
R P
i

(
= (
+
(



( )
360
207000 0.00625
1447.37
1 1 0.00625
R RM

= =
+
M1A1

(b) To settle the four payments

( ) 1 1
n
i
A R
i
(
+
= (
(




( )
4
1 0.00625 1
1447.37
0.00625
A
(
+
= (
(

= RM 5 843.98 M1A1
(c ) number of payments = 360 12(10) = 240

( ) 1 1
n
i
A R
i
(
+
= (
(



( )
240
1 1 0.00625
1447.37
0.00625
A

(
+
= (
(



= RM 179 665.12 M1A1
[8]









Zadoc2013

3. n = 300, D = 12000 , c = RM30, C
0
= RM25, C
h
= 0.20 x 30 = RM6 , C
b
=RM7.50
(a) Q*
0
2
h b
h b
DC C C
C C
| | +
=
|
\ .


( )( ) 2 12000 25
6 7.5
424.26 424
6 7.5
+ | |
= =
|
\ .

units M1A1
(b) S* *
h
h b
C
Q
C C
| |
=
|
+
\ .

6
424 188.44
6 7.50
| |
= =
|
+
\ .
M1A1
d
12000
40
300
= = B1
number of days to wait
* S
d
=
188.44
4.7
40
= = M1A1 [7]

4.








(a) Max{min}=3, Min{max} = 3 B1
thus, value of the game, v = 3 > 0 B1
Not a fair game. (Player X has the advantage.) B1
b) Player Y plays Y
1
, Player X plays X
2
B1, B1 [5]

5.












Key: Network & key D2
EST M1A1
LST M1A1

(b) Critical Path= B-C-E-F-H & Min.completion time = 52 wks B1B1
(c) Yes, since the project completion time is 52 weeks= 1 year B2 [10]


PLAYER Y
Row
min
Y
1
Y
2
Y
3

PLAYER X
X
1
-4 -1 3 -4
X
2
3 4 7 3
X
3
2 1 5 1
Column max 3 4 7
A 6
0 2
B 8
0 0
C 15
8 8
D 4
23 25
E 6
23 23
F 15
29 29
G 12
29 32
H 8
44 44
START
0 0
END
52 52
Act Dur
EST LST


Zadoc2013


6. Let x = number of product A
y = number of product B
LP model : Maximise profit z = x + 1.5y subject to B1
x + y s 1500 B1
ys 0.5x B1
x > 0 , y > 0 B1











































200
1400
1200
800
600
400
y
x
0
|
200
|
400
|
600
|
800
|
1000
|
1200
|
1400
y = 0.5x
y + x = 1500
x +1.5y = 300
1500
(1000,500)
1000
Lines correct D1
Search line D1
Region D1


From the graph, max pt (1000,500)
Manufacturer produces 1000 product A and 500 product B A1, A1
to obtain a maximum profit = 1000 + 1.5(500) M1
= RM 1750 A1 [11]




Zadoc2013

SECTION B

7. (a) 2 1800 q p =


( )
2
2
4 1800
0.25 1800
q p
q p
=
=


2
1800 0.25 p q = A1
Revenue, ( ) R q pq =

( )
2
1800 0.25q q =

( )
3
1800 0.25 R q q q = M1A1

Profit = Revenue Cost
P(q) = R(q) C(q)
= 1800q 0.25q
3
(630q 0.1q
3
) M1
= 1170q 0.15q
3
A1

(b) P (q) = 0
1170 0.45q
2
= 0 M1
q
2
= 2600
q = 50.99 51 units

( ) '' 0.9 P q q =
When x = 51, ( ) ( ) '' 51 0.9 51 0 P = < M1
Thus, profit is maximum when x = 51 A1
Maximum profit = 1170(51) 0.15(51)
3

= RM 39 772.35 A1

(c )(i) At equilibrium point, Demand = Supply
2 1800 2 9 200 p p = M1


1800 9 200
10 2000
200
p p
p
p
=
=
=

When p = 200, q = 2 1800 200 80 =
Thus, the equilibrium price = RM200
equilibrium quantity = 80 units A1(both)

(ii)
D1, D1






If charges more than the equilibrium price, there will be a surplus of supply B1
while if charges less, there will be a shortage of supply. B1 [15]

0
q
p
1800
84.85 -
22.22 200
80 -
Demand curve
Supply curve


Zadoc2013

8.

Bob
Row
Min

I II III IV
Ali
I 2 3 2 5 2
II -3 1 3 -4 -4
III 4 1 6 0 0
IV 3 -2 4 -5 -5
Colmn max 4 3 6 5

(a) Max{min}= 2 , Min{max} = 3 M1
Play-safe strategy: Ali plays I, Bob plays II A1
Since max{min} = min{max} , no saddle point.
Thus, game is unstable. B1

(b)
2 3 2 5
3 1 4 3
4 1 6 0
3 2 4 5
| |
|

|
|
|

\ .

2 3 2 5
4 1 6 0
3 2 4 5
| |
|
|
|

\ .

2 3 5
4 1 0
3 2 5
| |
|
|
|

\ .

2 3 5
4 1 0
| |
|
\ .
M1



Bob

I II IV
Ali
p I 2 3 5
1 p III 4 1 0


















Bobs Strategy Expected pay-off of Ali
I y
1
=2p + 4(1 p) = 4 2p
II y
2
= 3p + (1 p) = 2p + 1
IV
y
3
= 5p
M1
p
Expected pay-off
1 -
6 -
0
1
y
3

y
2

4 -
y
1

Expected gain;
4 2p = 2p + 1
4p = 3

3
4
p =

Graph D1
M1
A1


Zadoc2013

To find Bobs Optimal Strategy: delete column IV




( ) ( )
( )
1 3 2 1
1 3 4 2
c b
q
a b c d
q

=
+

= = =
+

( ) ( ) 2 3 1 4 1
1
2
q q q q
q
=
=

Optimal Strategy: Ali
3 1
, 0, , 0
4 4
| |
=
|
\ .


Bob
1 1
, , 0, 0
2 2
| |
=
|
\ .

Value of the game =
3 1
2 1 2
4 2
| |
+ =
|
\ .
M1A1
Ali has the advantage B1

[15]


Bob

I II

q 1-q
Ali
I 2 3
III 4 1
M1
A1
A1
A1
OR