1. a) Find the complexity of the following algorithm. What will be the output for m=n=6?...

 

Transcribed Image Text:

1. a) Find the complexity of the following algorithm. What will be the output for m=n=6? FinalGame(int m, int n) for (i=0; i<m; i++) for(j=1; j<n; j=2*j) print(i+j) [10] b) Suppose you have to pay your bill of 'k' cent. You can use the array of coin [20] denominations C = {1, 2, 5, 7, 10, 20} to pay the bill. Here, k = 44 Determine the minimum number of coins you could spend to pay the bill. Also, determine the coins you have chosen to pay the bill using Dynamic Programming approach. 1. a) Find the complexity of the following algorithm. What will be the output for m=n=6? FinalGame(int m, int n) for (i=0; i<m; i++) for(j=1; j<n; j=2*j) print(i+j) [10] b) Suppose you have to pay your bill of 'k' cent. You can use the array of coin [20] denominations C = {1, 2, 5, 7, 10, 20} to pay the bill. Here, k = 44 Determine the minimum number of coins you could spend to pay the bill. Also, determine the coins you have chosen to pay the bill using Dynamic Programming approach.

Answer rating: 100% (QA)

The question contains two separate parts so I will address them one at a time Part a Complexity of Algorithm Output for mn6 The provided algorithm Fin... View the full answer