A Level Practice paper

1 a Starting with AB means that H cannot be included without repeating either B or A.

b AHBCEFGDA

c Draw a polygon matching the Hamiltonian cycle and look at the inside edges one at a time.

AB(I), AG, BF, BG, CD, CF

AB(I), AG(I), BF, BG, CD, CF
AB(I), AG(I), BF(I), BG(I), CD(O), CF
AB(I), AG(I), BF(I), BG(I), CD(O), CF(I)
The graph is planar.

2 a

All of the numbers have now been selected as pivots, so the list is in order.

© Pearson Education Ltd 2018. Copying permitted for purchasing institution only. This material is not copyright free. 1
 b Using the first fit decreasing algorithm with reels of size 80
47 → 1
42 → 2
41 → 3
36 → 4
33 → 1 making it 80
31 → 2 making it 73
27 → 3 making it 68
24 → 4 making it 60
18 → 4 making it 78
16 → 5
12 → 5 making it 28
18
33 31 27 24 12
47 42 41 36 16
5 reels are required.

5000 log 5000

c 0.034 × = 0.27 seconds
800 log 800
This is only an estimate because the time taken is only approximately proportional to n log n

3 a A network is semi-Eulerian if it has exactly two odd nodes.

b The odd nodes are A, B, C, D, E, F but we can ignore E and B.

Possible pairings: AC + DF = 10 + 10 = 20
AD + CF = 11 + 9 = 20
AF + CD = 2 + 10 = 12
So we use AF and CD
Minimum length = 72 + 12 = 84 miles

c AF, CD

d This time we can ignore E and C

Possible pairings: AB + DF = 4 + 10 = 14
AD + BF = 11 + 5 = 16
AF + BD = 2 + 13 = 15
So we use AB and DF
The route is extended by 14 − 12 = 2 miles

© Pearson Education Ltd 2018. Copying permitted for purchasing institution only. This material is not copyright free. 2
4 a Dijkstra’s or Floyd’s Algorithm

b Arc AC because of lack of symmetry in the table

c

d In final iteration look at row A column E – goes through C

Now look at row A column C – goes through B
So ABCE and length 22

© Pearson Education Ltd 2018. Copying permitted for purchasing institution only. This material is not copyright free. 3
5 a 12 x + 30 y 240, i.e. 2 x + 5 y 40
x
12 x + 30 y 2 ( 5 x + 20 y ) , i.e. x 5y or y
5
5 x + 5 y 55, i.e. x + y 11
6 x + 12 y 96, i.e. x + 2y 16
b

c
 80 16   40 8 
Vertex (6, 5) (5, 6)  ,   , 
 7 7   3 3
Profit £153 £166 £139.43 £162.67

So Angie should make 5 mini-packs and 6 mega-packs and the corresponding profit will be £166.

6 a

So 4 workers are required

c Delay the start of activity H by 2 days and the start of activity J by 2 days.

© Pearson Education Ltd 2018. Copying permitted for purchasing institution only. This material is not copyright free. 4
7 a The purpose of the first stage is to provide a basic feasible solution as a starting point for the
second stage.
b Using slack, surplus and artificial variables we obtain:
2 x + y + z + s1 = 50
x + 3 y + z + s2 = 60
x − s3 + a1 = 10
This gives the first 3 lines of the tableau
P − x − 2 y − z = 0 gives the 4th line
We want to maximise I = − a1 = x − s3 − 10
⇒ I − x + s3 = −10
which gives the 5th line

b.v. x y z s1 s2 s3 a1 Value
s1 2 1 1 1 0 0 0 50
s2 1 3 1 0 1 0 0 60
a1 1 0 0 0 0 −1 1 10
P −1 −2 −1 0 0 0 0 0
I −1 0 0 0 0 1 0 −10

c So setting s3 , y, z = 0 we obtain the first solution of

I = 0 when a1 = 0, s1 = 30, s2 = 50

d x now replaces a1 as a basic variable so we obtain the following table

b.v. x y z s1 s2 s3 Value
s1 0 1 1 1 0 2 30
s2 0 3 1 0 1 1 50
x 1 0 0 0 0 −1 10
P 0 −2 −1 0 0 −1 10

The smallest negative value in the bottom row is −2

So the y-column is the pivot column
The smallest value of θ is then 50 ÷ 3
So the pivot is the 3 in the y-column

© Pearson Education Ltd 2018. Copying permitted for purchasing institution only. This material is not copyright free. 5
e The iterations are as follows:

bv x y z s1 s2 s3 Value
s1 0 1 1 1 0 2 30
s2 0 3 1 0 1 1 50
x 1 0 0 0 0 −1 10
P 0 −2 −1 0 0 −1 10

Row
bv x y z s1 s2 s3 Value
operations
s1 0 1 1 1 0 2 30
1 1 1 50
y 0 1 0 R2 ÷ 3
3 3 3 3
x 1 0 0 0 0 −1 10
P 0 −2 −1 0 0 −1 10

Row
bv x y z s1 s2 s3 Value
operations
2 1 5 40
s1 0 0 1 − R1 − R2
3 3 3 3
1 1 1 50
y 0 1 0
3 3 3 3
x 1 0 0 0 0 −1 10
1 2 1 130
P 0 0 − 0 − R4 + 2 R2
3 3 3 3

Row
bv x y z s1 s2 s3 Value
operations
3 1 5 3
z 0 0 1 − 20 R1 ×
2 2 2 2
1 1 1 50
y 0 1 0
3 3 3 3
x 1 0 0 0 0 −1 10
1 2 1 130
P 0 0 − 0 −
3 3 3 3

Row
bv x y z s1 s2 s3 Value
operations
3 1 5
z 0 0 1 − 20
2 2 2
1 1 1 1
y 0 1 0 − − 10 R2 − R1
2 2 2 3
x 1 0 0 0 0 −1 10
1 1 1 1
P 0 0 0 50 R4 + R1
2 2 2 3

So solution is P = 50 when x = 10, y = 10, z = 20

© Pearson Education Ltd 2018. Copying permitted for purchasing institution only. This material is not copyright free. 6