A feature of a task-dependency graph that determines the average degree of concurrency for a given granularity is its ___________ path?
A)critical
B)easy
C)difficult
D)ambiguous

Question

Quizplus · Accepted Answer

The critical path in a task-dependency graph determines the longest sequence of dependent tasks, which in turn sets the minimum time required to complete the entire set of tasks. The length of the critical path directly influences the degree of concurrency, as tasks not on the critical path may be executed in parallel, assuming resources are available.

A Feature of a Task-Dependency Graph That Determines the Average