Solved

In Task Dependency Graph Longest Directed Path Between Any Pair

Question 24

Multiple Choice

In task dependency graph longest directed path between any pair of start and finish node is called as --------------

A) total work
B) critical path
C) task path
D) task length

Related Questions

Q15: which of the following is a an

Q16: which of the following is not a

Q17: In ------------task are defined before starting the

Q18: Topological sort of a Directed Acyclic graph

Q19: which problems can be handled by recursive

Q20: the procedure is disturbed and require only

Q21: Which of the following is not a

Q22: which of the following is not an

Q23: CUDA thought that 'unifying theme' of every

Q25: Which of the following is not an