Explanation by: Mr. Dubey
a greedy algorithm gives optimal solution for all subproblems, but when these locally optimal solutions are combined it may not result into a globally optimal solution. hence, a greedy algorithm cannot be used to solve all the dynamic programming problems.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. In counter universal clock is not used.

Q. What can an inclusion use case be used for?

Q. The MSI chip 7474 is

Q. What can be the minimum sum of digits for a 4 digit number?

Q. Explain what is meant by PRODUCT with reference to one of the eight principles as per the ACM/IEEE Code of Ethics ?

Q. What happens when a class with parameterized constructors and having no default constructor is used in a program and we create an object that needs a

Q. Which of the following will not raise error if not used?

Q. A hacker guessing suggested password to a program is call as?

Q. What is the purpose of ISO 9001:2008 in QMS?

Q. The earliest calculating devices are

Question analytics