CourseCourseConceptConceptDocsDocuments

Edexcel A-Level Mathematics AS D1.4.3 Algorithm for Finding the Critical Path Questions

Practise completing activity networks with early and late event times, then using them to find critical activities, paths and project duration.

Syllabus
First assessment 2019
Course
Mathematics YMA01
Level
AS

Exam points

  • complete early and late event times on an activity network using forward and backward passes
  • state critical activities or the critical path from events where no scheduling slack remains
  • use the completed network to state the minimum project completion time

Edexcel A-Level Mathematics AS D1.4.3 Algorithm for Finding the Critical Path Questions question 1

[Maximum number: 5]
Table for Question Edexcel A-Level Mathematics AS D1.4.3 Algorithm for Finding the Critical Path Questions question 1 — Edexcel A-Level Mathematics AS
Table for Question Edexcel A-Level Mathematics AS D1.4.3 Algorithm for Finding the Critical Path Questions question 1 — Edexcel A-Level Mathematics AS
Table for Question Edexcel A-Level Mathematics AS D1.4.3 Algorithm for Finding the Critical Path Questions question 1 — Edexcel A-Level Mathematics AS
Diagram 1

Diagram 1

Diagram 2

Diagram 2

Figure 2

Figure 2

[The sum of the durations of all the activities is 133 days]
A project is modelled by the activity network shown in Figure 2. The activities are represented by the arcs. The number in brackets on each arc gives the time, in days, to complete the activity. Each activity requires one worker. The project is to be completed in the shortest possible time.

Question (a)

(a)

Complete Diagram 1 in the answer book to show the early event times and the late event times.

[ 4 ]

Question (b)

(b)

State the critical activities.

[ 1 ]
All question bank results loaded