Dr st\r c(.

)
1.
A 1 Ao
31 10 38 45 19 47 35 28 1'2 1

C 2 C )
(a) Use the first-ht bin packing algorithm to determine how the numbers listed above can be
packed into bins ofsize 60 H 3 H o3
(3)
J 4 J 4
(b) Carrf, out a quick sort to produce a list of the numbers in descending order. You should show
the result ofeach pass and identify your pivots clearly. P 5 P
(4)
Figure I Figure
\ 2
I
(c) Use the first-fit decreasing bin packing algorithm to determine how the numbers listed can be
\
packed into bins ofsize 60 Figure I shows the possible allocations o-f five employees,
\ e) Janelle (J) and Polly (p), to five tasks
Ali (A), Campbell (C), Hugo (H)
I l, 2, 3, a and 5.

(d) Determine whether the number of bins used in (c) is optimal. Give a reason for your answer. (a) Explain why it is not possible to find a complete matching.
(2)

Bro I : St, l0r li 6ro-2 r 38, tZ Brn}. 4S r 11 marks) It is decided that one of the emproyees should be
Q)
trainedso that a complete matching becomes
possible. There are only enough funds
Brn rf r t? 8rn 5 : 35 8rn 6:28 for one.rrrpioy"" to be trained.

to underso training. Janelte can be rrained

ffi":j1r",H1::;:,.r**. to do task or Hugo can be
gr ro 38 tls t'! ++ 3s zt tz
1

b)
t' which en.rprovee. Jane,e or Hugo, shourd undergo

31 3E r+s tl 3s2rmro E
training. Give a reason for your
3:;::
Q)

Et3i"at 11,3s.sm19 You may now assume that the emproyee you

Figure 2 shows an initial matching.

identified in (b) has successfulry undergone
trai,ing.

Effil Br 3s E Ltr rz lo tcl

(c) Starting from the given initiar matching,
use the
-aiternating maximum matching argorithm to find a
33sl sr U trl IL to ;#1r',:t;.-"t"ning'
You should list the
fr,r, ,rr* you use, ;; ;"#;
complere

(3)

(Total 7 marks)
a,) H rs fi^e- o, ootptoSe{- t^'ho crr* oo
*crrhrr r **I?

cl &nl : {:+rt2 L) fu,++llc-,

l Brnz: q.SJlO B,n3:3811? Ftolo @oia noi^) lo j arA tr-l
gras :31, Zg c) P-t'c-s '=f,:Iztt.3
cS tt1=
I

B,aq: 3s
I
I S=Z-P=!.-C=S-J=r -Hi
?9S 4.+ :.
I

lar tou"{f a SbrnS forr1ptr*lL

6o- =

FL ci5 H.,3 J; t ?: tp
 t t2

3,,
t2 35 30

\z----)" RleE
Figure 3

each arc represents the time taken, in

Figure 3 represents a network of roads' The number on
minutes, to traverse each road.

(a) Use Dijkstra's algorithm to find the quickest route from

S to T' State your quickest route and I
the time taken. (6) Figure 4
[The total weight ofthe network is 359 cm)
It is now necessary to include E in the route' Figure 4 represents the network of sensor
wires used in a medical scanner. The number
represents the length, in cm, ofthat section on each arc
(b) Determine the effect that this will have on the time taken
for the joumey' You must state your ofwire.
new quickest route and the time it takes' (3) After production, each scaruter is tested.

c 13130
o\ SA CFD C(T ( rz) A machine will be programmed to inspect each
section of wire.

€T ( 1s) It will havel along each arc of the network at least

once, starting and finishing at A. Its route must

/lx b) SACFD be of minimum length.

(a) use the route inspection algorithm to find the

t2 \,, make your method and working clear.
length of a shortest inspection route. you
must

(s)

Al2ltt F I tt lltt
The machine will inspect I 5 cm of wire per second.
30 rr
(b) Calculate the total time taken, in seconds,
to test 120 scarmers.
\ /w: It is now possible for
Q)

L
lrs 38 the machine to start at one veftex and
inspection route of minimum length i, ,Uff '-"- finish at a different vertex. An .
."qri."a.
/\/
sI I lO / 54 \tr[tlrl ,2 FT qle 10
r lilrr
11rs ?'
(c) Explain why the machine should be programmed
to start at a vertex with odd degree.
(2)
S*s so 5b Due to constraints at the factory,, only B
be a 2 second pause between rcsts.
or D can be chosen as the starting point and
there will also

(d) Determine the new minimum total ti*re now

tuken to test r20 scanners. you must state
vertex you are starting from and make your which
calcurations crear.
14 (4)

c;
Key (Total 13 marks)

of Final
Bl5 6l Verlex
Order

(}s I " lr* I

labelling

Working values
value
 t7
rt
;) gP sL Ff,- 3s ? ?o- CeSoa-t

19 35
,gr- zs _p:!_ 31_ Jq!_FiDq,

.tn rf,
b) +LlxltO : g36g se.-.
E
c) 0rob\orn Carr ,\prd IrO Sot^rc8 rrr.tL a-
,f --$en\F&$ernl j1.*p}*, q*ib..--.{*e'Str lr
Figure 4

lThe total weight of the network is 359 cml

q^^., e^D
'roEL4 cr,\.- +^s oOO gntf .
* U.-ro"rhc- PGrsScA {trrou3\a. noc}r-
- "fFarED .i\^rra-t, ft;s-trn0exf- :;--ttec.'${*
eleJ ^o1- he. aED.
^^t,F#

di lP je^ .iqb: Fi
)::ii
= iflt-
l I

i ,G4 +alo
ttri
,*g
rt,i i

;::1

i,
.8c-ci
tl
5. A linear programming problem in x and y is described as follows. itu,
Maximise P:2x+3y v
Itg'h
120
subject to

x>-25 110

v>25 100
7x+8y(840 \,
90
4y(5x I

5y)3x 80
/
x,y>0 70 / 5qotr*
(a) Add lines and shading to Diagram 1 in the answer book to represent these constraints. Hence
/f
60
determine the feasible region and label it R.

(b) Use the objective line method to find the oplimal vertex,
(4)

Y of the feasible region. you must

50 I
clearly draw and label your objective line and the vertex V. t)
(3) 30
(c) Calculate the exact coordinates ofvefiex V_

(2)
20

10
iI (./ltl t) 1f$
Given that an integer solution is required,

(d) determine the optimal solution with integer coordinates You must make your method clear.
(2)
10 20 30 40 so oo rg 80 sb loo rio rjd
Diagram, \ 1r,[351no
(Total 11 marks) Obft)

p -- 2-L*33 2x +35 l?tl 1={o

' I-=6C)
ttg a5x- :lac+ 8b= 8ilt9
t-J
ta*s tto '" " Ilg
itu s l0)t-
J( q& (.lr:
r?
IOSO
(rt,sr) ) '
i7
[soroe] {ft" birptr ?' bc+Be

li
/t ,/
5z) 6e.
5l'e.s
.9 Slf r/ aZ83 r

[h'n, [Sorbq Crarer ) 6l'23 r' *zst

.?:
,

'3t L=SOI $= 5l
i\o.'f, ? = b2;t3
 Draw the activity network described in the precedence table below, using activity on arc and 8. A manufacturer offrozen yoghurt is going to exhibit at a trade fair. He will take two types offrozen
the minimum number of dummies. yoghurt, Banana Blast and Strawberry Scream.

Immediately preceding He will take a total of at least 1000 litres of yoghurt.

Activity
activities
He wants atleast25Yo ofthe yoghurt to be Banana Blast. He also wants there to be at most halfas
A
much Banana Blast as Strawberry Screarn.
B
Each litre of Banana Blast costs f3 to produce and each litre of Strawbery Scream costs f2 to
C produce. The manufacturer wants to minimise his costs.
D rA, C
Let x represent the number of litres of Banana Blast and
E B
y represent the number of litres of
Strawberry Scream.
F E
Formulate this as a linear programming problem, stating tlle objective and listing the constraints as
G
simplifi ed inequalities with integer coeffrcients.
H D,F
v^u should not attempt to solve the problem.
T D,F
J H, I (Total 6 marks)

Explain why each ofyour dummies is necessary

cc+$ ? rooo
/Tofal 7 marks 2S/. (r+g).( * )'z*
$
(r 3rr zg o.zSr+ O.?r3 S ,-
O.LSg ( o,?Src.
,.4 4 6*
,
Otr;c-alrue- ts hD rrrrn (rnts C (t)
C'3rr2$
a

,
^ S*bJ."I. +.,

J t'z* gs3x"
I-:+g >r ltpb
o-@ Cr JePcnls o^ t b'h, -
D clePcalc o'\ A 31*C
@-o trro tr..ro thg\ ^^4,\t Staa*- t(rq
a.c,tt*r
So.rr...c, Sfr^rrt aAe.D enJ c-r.ace^* -
 *t
1

D (4) qgr lq
..'-T-N
z\r lrll \r1ro;
E
,t\
u
r4 1l\"", 22
vr
II
o
o / ,,,, ?v*o' I
ts K (7)

G (4)
5 I
rs
4 Key:
Figure 5 I

I
I
fE*r"_l
Aproject is modelled by the activity network shown in Figure 5. The activities are represented by rl, I

| (4) I |
the arcs. The number in brackets on each arc gives the time, in days, to complete the activity. Eacir
activiry requires one worker. The project is to be completed in the shortest possible time. I
I I

I "u"*
ti-. I

I Lur"
I

I I

| ..,.rt
(a) Complete Diagram 1 in the answer book to show the early event times and late event times.
lsl q
I ti,,"
I

(b) Calculate the total float for activity D. You must make the numbers you
(1)

use in your calculation

sl G'() Iq I

clear.
(2\
Diagram I
(b)
(c) Calculate a lower bound for the number of workers needed to complete the project in the
minimum time. You must show your working. 4t eqt rr!\ D 5- lL-k-tt g t*
(2)

The project is to be completed in the minimum time using as few workers as possible. (3= 95}=7-.\Ft3,J*"
1Lz
(d) Schedule the activities using Grid 1 inthe answer book.
(3)
2 4 8._- 1.0*_ 12 14 16 )A 24
g 26
1
(Total 1l marks)
l- ,q H ;14 j: ',hrl
le ,0,
ii i,

:ru
,1i t,1
E l , ,tr, ;tl
i:

* , ia l t,i
'f- -l '1 , ,wz
ll
le
lt
A o :F 'I'
ilr
a,
i:ittr
I

l,!i,,tps
lt!
l,
ia
tl
tl
+a- : ..1 *t- ; a-t- L ,
lJ rl
ttl
;l i lir iltitii
I