You are on page 1of 1

SUBJECT NAME & CODE: DAA & ECSDAA0IT

SESSION: 2020-21

UNIT NO.: 2

Assignment NO.:2

1. What is Knapsack problem? Give the solution to solve it using dynamic programming technique.

2. Give an algorithm to solve the knapsack problem.

3. Explain the concept of Greedy technique.

4. Explain Prim's algorithm with an eg.


5. Explain Kruskal's algorithm with an eg.

You might also like