Q. In task dependency graph longest directed path between any pair of start and finish node is called as -------------- (Solved)
1. total work
2. critical path
3. task path
4. task length
- b. critical path
1. total work
2. critical path
3. task path
4. task length