Tip: Choose Save as PDF in the print dialog to download. Use A4 paper size.
Shade in the A or B circle for each question.
Draw a line connecting each item on the left to its match on the right.
| Left column | Right column | |
|---|---|---|
| 1A(2) -> B(3) -> D(4) = 9 days | AA task with 5 days of float can slip 1 day without delaying the project, so the finish date does not change. | |
| 2Float = 3 days | BCritical task: 4 days -> 6 days, Project: 9 days -> 11 days | |
| 3The critical path decides the shortest possible project length, because it is the longest chain of dependent tasks | CPath 1: 9 days, Path 2: 6 days -> Project = 9 days | |
| 4If a critical task is delayed, the whole project finish date is delayed by the same amount | DThe critical path is the longest chain of dependent tasks, not the shortest, because the longest chain sets the minimum project time. | |
| 5Critical path = shortest chain of tasks (6 days) | EA non-critical task can be delayed by up to 3 days without delaying the project finish | |
| 6Task off the critical path delayed 1 day (float 5) -> Project finishes 1 day late | FAdding the durations along a chain of dependent tasks to find its total length; the longest chain is the critical path |
Complete each line of code by filling in the missing parts.
Shade in the letter of the line that contains an error.
critical path — The longest chain of dependent tasks in a project. It sets the shortest possible finish time, and any delay to a task on it delays the whole project. Tasks off it have float.pathLength ← taskA + taskB + taskDpathOne ← 3 + 4 + 2
criticalPath ← MAX(pathOne, pathTwo)float ← latestStart - earliestStartIF float = 0 THEN
SET onCriticalPath ← TRUE
END IFIF taskDelay > 0 AND onCriticalPath THEN
projectEnd ← projectEnd + taskDelay
END IF