a) Solve the following instance of the fractional krapack problem by ving the greedy method: The...

 

Transcribed Image Text:

a) Solve the following instance of the fractional krapack problem by ving the greedy method: The item sizes are 2,4,5, and 7 and values 133, and knapsack capacity is 18. is it possible to find an exact greedy method for the 0-1 knapa Which one of the two problems is NP-complete 0/1-pack pritien fractional knapsack problem? b) Explain Kruskal greedy algorithm criteria to find a minimum wh graph containing n vertices and medges using the following graph 13 S c) In which case Prim's Algorithm is better than the Kruskal algorithm in terms of time complexity, for a graph with n vertices and medges? In which case Kruskal's algorithm is better? Explain why the minimum spanning tree is not NP-complete? [10 marks] [5 marks] a) Solve the following instance of the fractional krapack problem by ving the greedy method: The item sizes are 2,4,5, and 7 and values 133, and knapsack capacity is 18. is it possible to find an exact greedy method for the 0-1 knapa Which one of the two problems is NP-complete 0/1-pack pritien fractional knapsack problem? b) Explain Kruskal greedy algorithm criteria to find a minimum wh graph containing n vertices and medges using the following graph 13 S c) In which case Prim's Algorithm is better than the Kruskal algorithm in terms of time complexity, for a graph with n vertices and medges? In which case Kruskal's algorithm is better? Explain why the minimum spanning tree is not NP-complete? [10 marks] [5 marks]

Answer rating: 100% (QA)

The image appears to be of a question paper with a question that is partially visible Unfortunately ... View the full answer