Quelpr
3 marksGraph Theory and Critical Path Analysis

CAPE Applied Mathematics Unit 2 · 2010 · Paper 2 · Question 1(c)

A directed/undirected network graph with vertices A, B, C, D, E is shown.

For the diagram provided, list any THREE paths which start and finish at A.

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. 1(a)(i)On the answer sheet provided, graph the feasible region for the programming problem.[8 marks]
  2. 1(a)(ii)Hence, solve the linear programming problem.[4 marks]
  3. 1(b)(i)Use the Hungarian algorithm to determine the task to which EACH person must be assigned in order to minimise the total time.[8 marks]
  4. 1(b)(ii)Hence, determine the total time taken by the FIVE persons.[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