Gate
Exam
What is the minimum possible weight of a path P from vertex 1 to vertex 2 in this
graph such that P contains at most 3 edges?
Read Solution (Total 0)
Gate Other Question
What is the minimum possible weight of a spanning tree T in this graph such that
vertex 0 is a leaf node in the tree T?
5 skilled workers can build a wall in 20days: 8 semi-skilled workers can build a wall
in 25 days; 10 unskilled workers can build a wall in 30days. If a team has 2 skilled, 6
semi-skilled and 5 unskilled workers, how long will it take to build the wall?