engineering recuitment NIC NIELIT Scientist B 2023 Mock Test Algorithms Algorithm Design Techniques Dynamic Programming
Consider the following statements:
(i). Any Dynamic Programming algorithm with n subproblems will run in O(n) time.
(ii). Dynamic programming solves a problem faster then greedy greedy method.
(iii). Unlike greedy algorithms, dynamic programming methods always provide correct/optimal solution.
Which of the above statement/s is/are correct?
1
(i) only
2
(i) and (iii) only
3
(iii) only
4
All are True