[Solved] What is Critical Path?

McqMate

Q.	What is Critical Path?
A.	the length of the longest path in a task dependency graph is called the critical path length.
B.	the length of the smallest path in a task dependency graph is called the critical path length.
C.	path with loop
D.	none of the mentioned.
Answer» A. the length of the longest path in a task dependency graph is called the critical path length.

2.3k

0

Do you find this helpful?

9

View all MCQs in

High Performance Computing (HPC)

Discussion

No comments yet

Related MCQs

In task dependency graph longest directed path between any pair of start and finish node is called as --------------
In Dijkstra's all pair shortest path each process compute the single-source shortest paths for all vertices assigned to it in SOURCE PARTITIONED FORMULATION
The length of the longest path in a task dependency graph is called?
A feature of a task-dependency graph that determines the average degree of concurrency for a given granularity is its ___________ path?
The critical issue in parallel depth-first search algorithms is the distribution of the search space among the processors.