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.

💬 Discuss

✅ Correct Answer: (A) the length of the longest path in a task dependency graph is called the critical path length.

Published by Mr. Dubey ⭐ 111.42K Points at 17-Sep-2023 08:10 am in High Performance Computing

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

255

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

92%

Success Rate