Department of Computer Science & Engineering Unit Test I Subject: DAA Marks: 25

5 7 13

1. Convert integer multiplication from recursive implementation to an iterative function optimum solution. 3. Find the minimum cost spanning tree by using Kruskal's and Prim's algorithms.

2. Given n = 5, M = 100, W = {10, 20, 30, 40, 50} and P = {20, 30, 66, 40, 60}. Find the

Department of Computer Science & Engineering Unit Test I Subject: DAA Marks: 25
5 7 13

4. Convert integer multiplication from recursive implementation to an iterative function optimum solution. 6. Find the minimum cost spanning tree by using Kruskal's and Prim's algorithms.

5. Given n = 5, M = 100, W = {10, 20, 30, 40, 50} and P = {20, 30, 66, 40, 60}. Find the

Department of Computer Science & Engineering Unit Test I Subject: DAA Marks: 25
5 7 13

7. Convert integer multiplication from recursive implementation to an iterative function optimum solution. 9. Find the minimum cost spanning tree by using Kruskal's and Prim's algorithms.

8. Given n = 5, M = 100, W = {10, 20, 30, 40, 50} and P = {20, 30, 66, 40, 60}. Find the