Critical Path Algorithm Concepts

This lesson covers the application of Version 1 of the Critical Path Algorithm. It begins with a review of the four steps of the algorithm, followed by an example to verify the critical path and create a priority list. The lesson then demonstrates how to create a schedule using the priority list and assign tasks to processors. The lesson concludes with a comparison to a computer-generated solution, highlighting the efficiency of the algorithm in project scheduling.

What is the first step in Version 1 of the Critical Path Algorithm?

• Find the critical path

• Remove the task from the diagraph

• Create a schedule

• Add the first task to the priority list

After identifying the critical path, what is the next step in the algorithm?

• Create a schedule

• Find a new critical path

• Remove all tasks from the diagraph

• Add the first task to the priority list

When a task is removed from the diagraph, what is the next action?

• Find a new critical path

• Mark it as complete

• Add it back to the diagraph

• Assign it to a processor

Which task is assigned to Processor 1 first?

• Task 3

• Task 4

• Task 2

• Task 1

What happens when Task 2 is completed?

• Task 1 becomes ready

• Task 4 becomes ready

• Task 5 becomes ready

• Task 6 becomes ready

Which task is assigned to Processor 2 after Task 1 is complete?

• Task 4

• Task 7

• Task 5

• Task 6

At what time is Task 9 completed?

• 21 hours

• 26 hours

• 34 hours

• 31 hours

Which task is the last to be completed in the schedule?

• Task 7

• Task 6

• Task 8

• Task 9

How long is Processor 2 idle at the end of the project?

• 3 hours

• 4 hours

• 5 hours

• 2 hours

What is the total time taken to complete the project?

• 34 hours

• 29 hours

• 26 hours

• 31 hours