Activity networks and precedence tables

Activity networks and precedence tables Test

Spec 4.1–2 · Edexcel International A Level Maths: Subtopic test

Studying this course? Keep your progress in one place.

Two ways to do this test

Question by question

One question at a time. Each answer is marked the moment you hand it in, so you learn as you go. Drago helps if you get stuck. All 10 questions, or just 5.

Exam mode

The whole paper in one go, timed like the real exam. Nothing is marked until you hand it in, then you get every mark explained.

10 questions, 27 marks

Edexcel International A Level Maths

Activity networks and precedence tables

Total 27 marks

Name

Class

Date

  1. 1
    A project has five activities, A to E. Activities A and B have no predecessors. C has immediate predecessor A only. D has immediate predecessors A and B. E has immediate predecessors C and D. The project is modelled by an activity network with activities on arcs.
    (a)
    Which activity can start as soon as A has finished, even if B has not yet finished?
    [1 mark]
    • AC and D
    • BD only
    • CC only
    • DE only
    Show the mark scheme

    Mark scheme

    Answer: C
    (b)
    A student draws D starting at the event where B finishes, with no dummy, and C starting at the event where A finishes. What is wrong with this network?
    [1 mark]
    • AD would not depend on A
    • BC would depend on B as well as A
    • CE would not depend on C
    • DB would depend on A
    Show the mark scheme

    Mark scheme

    Answer: A
    (c)
    Explain why the correct network needs a dummy activity, and state where the dummy is drawn.
    [2 marks]
    Show the mark scheme

    Mark scheme

    B1: C depends on A only but D depends on A and B, so C and D cannot start at the same event
    B1: a dummy from the event at the end of A to the event at the start of D (where B ends), so D waits for A without C waiting for B

    Accept: dummy from the end of A to the end of B

    Total for question 1: 4 marks

  2. 2
    A project has six activities, P to U. P and Q have no predecessors. R has immediate predecessor P only. S has immediate predecessors P and Q. T has immediate predecessor Q only. U has immediate predecessors R, S and T. The project is modelled by an activity-on-arc network.
    (a)
    Which activities have more than one immediate predecessor?
    [1 mark]
    • AS only
    • BR and T
    • CS, T and U
    • DS and U
    Show the mark scheme

    Mark scheme

    Answer: D
    (b)
    What is the minimum number of dummy activities needed in an activity-on-arc network for this project?
    [1 mark]
    • A1
    • B2
    • C3
    • D4
    Show the mark scheme

    Mark scheme

    Answer: B
    (c)
    Explain why S needs dummy activities but R and T do not.
    [2 marks]
    Show the mark scheme

    Mark scheme

    B1: R depends on P only and T on Q only, so they can start at the events where P and Q finish
    B1: S depends on both P and Q, so it must start at an event reached (by dummies) from the end of both P and Q

    Total for question 2: 4 marks

  3. 3
    An activity network has start event 1 and finish event 6. Its arcs are: A from event 1 to event 2; B from 1 to 3; C from 2 to 4; a dummy from 2 to 3; D from 3 to 4; E from 3 to 5; F from 4 to 6; G from 5 to 6.
    (a)
    Write down the immediate predecessors of each of the activities A, B, C, D, E, F and G.
    [3 marks]
    Show the mark scheme

    Mark scheme

    B1: A and B have no predecessors; C has A
    B1: D has A and B; E has A and B (through the dummy)

    B1: F has C and D; G has E
    (b)
    A new activity H is added, with immediate predecessors C and E only. F and G keep their predecessors. Explain why H cannot simply start at event 4, and describe how the network must be redrawn.
    [4 marks]
    Show the mark scheme

    Mark scheme

    B1: C and D both finish at event 4, so anything starting there would depend on D as well as C
    B1: C must finish at a new event instead of event 4

    B1: a dummy from this new event to event 4, so F still depends on C and D

    B1: H starts at another new event, with dummies to it from the end of C and from event 5 (the end of E), and finishes at event 6

    Accept: any other valid network in which H depends on C and E only and F, G are unchanged

    Total for question 3: 7 marks

  4. 4
    A project has activities A to G. A, B and C have no predecessors. D has immediate predecessor A only. E has immediate predecessors A and B. F has immediate predecessors B and C. G has immediate predecessors D, E and F, and is the last activity. The project is modelled by an activity-on-arc network with a single start event, event 1.
    (a)
    Describe a valid network for this project using exactly 3 dummy activities, by stating the start event and finish event of every activity and dummy.
    [6 marks]
    Show the mark scheme

    Mark scheme

    B1: A, B and C all start at event 1 and finish at three different events
    B1: D starts at the event at the end of A

    B1: F starts at the event at the end of C, with a dummy from the end of B to this event

    B1: E starts at a new event, with dummies to it from the end of A and the end of B

    B1: D, E and F all finish at the same event

    B1: G starts at that event and finishes at the finish event

    Accept: any numbering of events, or any other valid network with 3 dummies, e.g. A: 1 to 2, B: 1 to 3, C: 1 to 4, dummies 3 to 4, 2 to 5 and 3 to 5, D: 2 to 7, E: 5 to 7, F: 4 to 7, G: 7 to 8
    (b)
    A further activity H is added, with immediate predecessors D and F only. H is also a last activity, and G must still follow D, E and F. Describe the changes needed to your network from (a) and state how many dummy activities it now has.
    [6 marks]
    Show the mark scheme

    Mark scheme

    B1: D and F finish at a common event, from which H starts, so H depends on D and F only
    B1: E can no longer finish at the same event as D and F, otherwise H would depend on E

    B1: E finishes at a new event

    B1: a dummy from the event where D and F finish to the event where E finishes

    B1: G starts at the event where E finishes, so it depends on E and (through the dummy) on D and F

    B1: 4 dummies in total, and G and H both finish at the finish event

    Accept: any other valid network in which H depends on D and F only and G on D, E and F

    Total for question 4: 12 marks

End of questions

Subtopic tests