6.

24 148x 192s6179
The numbers in the list represent the exact weights, in kilograms, of9 suitcases. One suitcase is
weighed inaccurately and the only information known about the unknown weight, x kg, ofthis suitcase
is that 19 <.t (
23. The suitcases are to be transported in containers that can hold a maximum of
50 kilograms.

(a) Use the first-fit bin packing algorithm, on the list provided, to allocate the suitcases to
containers.
(3)

(b) Using the list provided, carry out a quick sort to produce a list of the weights in descending
order. Show the result of each pass and identi! your pivots clearly.
(4)

(c) Apply the first-fit decreasing bin packing algorithm to the ordered list to determine the 2
possible allocations of suitcases to containers.
(4)

After the first-fit decreasing bin packing algorithm has been applied to the ordered list, one of the
containers is ful1.

(d) Calculate the possible integer values ofx. You must show your working.
(2)

(Total 13 marks)
6.

14 19 17

B,nf i acb, trr*8 '

, z5l l+

l+ ?,)
-F_?-zl,t+
l.c)*1t
zqr-t Qc
L I- ?-l

9) B,nt : !J+I_L_ Brr I t L5,L*

G,O2::r,trnt*a @g
B,n 3 -: l?r ltlr9rb
6rn
-3-: tt/ lr+,g 16
7. (a) In the context of critical path aaalysis, define the term 'total froat'
(2)

D (9) r (4)
\
A(4) c(7) \
H6

B (s)
M (e)

G (3)

L(2)

Figure 3

Figure 3 is the activity network for a building project. The activities are represented by the arcs.
The number in brackets on each arc gives the time, in days, to complete the activity' Each activity
requires exactly one worker. The project is to be completed in the shortest possible time'

(b) Complete Diagram 1 in the answer book to show the early event times and the late event times.
(3)
(c) State the critical activities.
(1)

(d) Calculate the maximum number of days by which activity G could be delayed without affecting
the shortest possible completion time of the project. You must make the numbers used in your
calculation clear.
(2)

(e) Calculate a lower bound for the number of workers needed to complete the project in the
minimum time. You must show your working.
(2)

The project is to be completed in the minimum time using as few workers as possible.

(f) Schedule the activities using Grid 1 in the answer book.

(4)

(Tota! 14 marks)
7. (a)

- aezhurfr,ce. C-can tag l"J4ecr) C{"*r {^&.o 2^rqt

(b) rrr{lrlqr-F )c-\c..1rn3 1,t^l- cf rf:reaf f1erg.

Key:

tr-rvl
levent I

Itime I

lrut.
levent
I
I

| ,i'n.
(7) H(D
I

Diagram I
")-Cnrhc*L-:-firCr Srv\ a\ LFt-l[ '* U -

-: 3 relorho-r:.
0246810 12 14 16 182022242628303234
ytrrrrrrr
Fi I ,t irlttllttti ,rtlltltlttl,rrr|1 lltttllt
trittlt
:tt
Itt
ltt
g
q
6i llt atlttl
tllll 6t" (i ll it,ttlttllt
lltlllttttt
fi
IK
'i(i J'l , r r I r I I r
lltllltt:tl
I

-i
r rlTr
illlttlltltlrtttltllt
ltiltltttlttttttt;t{l
riTi-Tt ttttlttrl
It!ttlttltl
'ilt,ltttttlt
r JI i I r r r t
lllttlttttl
ittttltrrrr
t
lf
/
l.
L
8.

15 20

Figure 4

The graph in Figure 4 is bcing used to solvc a linear programming problem. The four constraints
have been drawn on the graph and the rejected regions have been shaded out. The four veftices of
the feasible rcgion R are labclled A, B, C and D.

(a) Write down the constraints represented on the graph.

(2)
The objective function, P, is given by

P:x+lqt
where /r is a positive constant.

The minimum value of the function P is given by the coordinates of vertex A and the maximum
value of the function P is given by the coordinates of vertex D.

(b) Find the range of possible values for,lc. You must make your method clear.
(6)

(Total I marks)
TOTAI FOR PAPER: 75 MARKS
5s t'2'
4c+5 >r36
tctg e 36
$s Lx-
 B(e , v)
c (qig)
DT[S_6}
ecol'k a,h D-z ?o1*ab C - l =--&tLg- --
lS+6tL > Q +t9r. 6>ral
o-Z *----
- Ira+uiiCLr*+rt4rL-- -
tr 19u
19+ (r
< f,+l2tu

@ rorEcl-G-r,s?-L- - -
9* < e5t