Register

CMI Assignment Question

232 views
0 votes
0 votes
How would we evaluate this recursive definition using dynamic programming?

(a) A one dimensional table t of size n, to be filled from t[1] to t[n]

(b) A one dimensional table t of size n, to be filled from t[n] to t[1]

(c) A two dimensional table t of size n×n, to be filled row-wise from t[1][1] to t[n][n].

(d) A two dimensional table t of size n×n, to be filled row-wise from t[n][n] to t[1][1].
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
rsansiya111 asked Dec 8, 2021
232 views
CMI Assignment Question
How much time will it take to evaluate this recursive definition using dynamic programming? (a) O(n) (b) O(n log n) (c) O($n^2$ ) (d) O($n^3$ )
How much time will it take to evaluate this recursive definition using dynamic programming?(a) O(n)(b) O(n log n)(c) O($n^2$ )(d) O($n^3$ )
User Avatar
1 votes
1 votes
1 answer
3
rsansiya111 asked Dec 7, 2021
347 views
NPTEL Assignment Question
The number of possible subsequences in a string of length n are: $n^{2}$ $2^{n}$ n! n(n-1)
The number of possible subsequences in a string of length n are:$n^{2}$$2^{n}$ n!n(n-1)
User Avatar
2 votes
2 votes
1 answer
4
rsansiya111 asked Dec 8, 2021
867 views
NPTEL Assignment Question
Suppose we do merge sort with a three-way split: divide the array into 3 equal parts, sort each part and do a 3 way merge. What would the worst-case complexity of this version be? O($n^2$) O($n^2$ log3n) O(n log2n) O(n $(log2n)^2$)
Suppose we do merge sort with a three-way split: divide the array into 3 equal parts, sort each part and do a 3 way merge.What would the worst-case complexity of this ver...
User Avatar
Link Copied!