Quelpr
1 markGraph Theory and Critical Path Analysis

CAPE Applied Mathematics Unit 2 · 2011 · Paper 2 · Question 2(b)(iii)b)

Five activities, A, B, C, D and E, make up a project with given durations and precedence relations.

Hence, determine the MINIMUM completion time of the project.

The mark scheme is shown once you've answered.

Practise this question

Other parts of this question

  1. 2(a)Four persons, A, B, C and D, are assigned to run a 4 x 400 relay. The average times in seconds are given. Use the Hungarian Algorithm to allocate runners to a…[7 marks]
  2. 2(b)(i)Construct an activity network for the project.[5 marks]
  3. 2(b)(ii)Copy and complete the table of Earliest Start Time, Latest Start Time, and Float for activities A to E.[10 marks]
  4. 2(b)(iii)a)Hence, determine the critical path.[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