Quelpr
6 marksGraph Theory and Critical Path Analysis

CAPE Applied Mathematics Unit 2 · 2017 · Paper 2 · Question 2(a)(i)

A project consisting of 9 activities R, S, T, U, V, W, X, Y, Z with durations and immediate predecessors is given.

Construct the activity network for the project.

This question uses a figure or table from the paper — you'll see it when you practise.

The mark scheme is shown once you've answered.

Practise this question

Other parts of this question

  1. 2(a)(ii)Complete the table of earliest start time, latest start time, and float for each activity.[4 marks]
  2. 2(a)(iii)State the critical path of the activity network.[2 marks]
  3. 2(a)(iv)Determine the minimum time needed to complete the project.[2 marks]
  4. 2(b)(i)Use the Hungarian algorithm to determine the task assignment for each worker that maximizes the total income.[9 marks]
  5. 2(b)(ii)Determine the total income of the workers for the four tasks.[2 marks]

More practice: the rest of this paper · more Graph Theory and Critical Path Analysis questions · all CAPE Applied Mathematics Unit 2 past papers