Testbook Test Series

Question

Comments

Only statement 2 is correct. Rest all wrong.

Answer 1

Answer : Only $\text{(i)}$ is correct.

1. For Fractional Knap Sack we can have Greedy algorithm but that does not give optimal solution for 0/1 Knap Sack .
2. Prim’s Algorithm to find MST of graph uses Greedy Approach .
3. Traveling Salesman problem can be solved using Dynamic Programming in 
   $O(2^n.n^2)$