Algorithms | Dynamic-Programming

Algorithms - Dynamic Programming

page 1 out of 3

Question 1

Every problem that can be solved using dynamic programming can be solved using recursion?

Question 2

What is the space complexity in coin change problem of sum ‘S’ having n different denominations if this problem is implemented in dynamic programming?

Question 3

Every problem that can be solved using dynamic programming can be solved using recursion and vice versa also possible?

True

False

Question 4

All problems that are solved by greedy algorithm can also solved using dynamic programming

True

False

Question 5

What is the time complexity of Longest sub sequence problem?

Question 6

Matrix A has (P X Q), Matrix B has (Q x R) what is the order of the resultant matrix in A X B?

Question 7

What are the possible ways possible in matrix multiplication to reorder parathesis using associate law?

((2n)! )/((n+1)! n !)

((n)! )/((n+1)! n !)

((2n)! )/((n-1)! n !)

((2n+1)! )/((n+1)! n !)

Question 8

In matrix chain multiplication, how many sub problems can possible?

Question 9

What are the attributes / conditions required to implement dynamic programming?

Optimal substructure

Overlapping sub problems

Both A & B

None of the above

Question 10

Optimal sub structure means if an optimal solution can be constructed from optimal solutions of its subproblems.

True

False

page 1 out of 3

Forgot Password

Password must be strong.Eg:@TheInquisitive123

Oops!!

To view the solution need to Login

Score : 0 / 0

THE INQUISITIVE

THE INQUISITIVE

Forgot Password