GATE 2023 Algorithm Quiz 9

Which of the following is not the dynamic programming problem?

Which of the following is/are property/properties of a dynamic programming problem?

Which of the following problems can be solved using dynamic programming?

a) Merge sort

b) Rod cutting

c) 8-Queens problem

d) Subset sum problem

Choose the correct code from below:

The difference between maximum possible profit for 0/1 Knapsack and fractional Knapsack problem with capacity (W) =

Consider the following statements:

(i). Any Dynamic Programming algorithm with n subproblems will run in O(1) time.

(ii). Dynamic programming solves a problem faster then greedy method.

(iii). Unlike greedy algorithms, dynamic programming methods always provide correct/optimal solution.

Which of the above statement/s is/are correct?