M

Mr. Dubey • 52.26K Points
Coach 

Q. A greedy algorithm can be used to solve all the dynamic programming problems.

(A) true
(B) false
(C) ---
(D) ---
Correct : Option (B)

Explanation: 
 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.

Share

Previous

Next

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. A partial order ≤ is defined on the set S = {x, b1, b2, … bn, y} as x ≤ bi for all i and bi ≤ y for all i, where n ≥ 1. The number

Q. Data used to build a data mining model.

Q. Some managers found out that

Q. Metric is

Q. Where is metadata stored in MySQL?

Q. The property states that the system must have a mechanism to recover from committed transactions should that be necessary.

Q. The cluster features of different subclusters are maintained in a tree called ___________.

Q. Point out the wrong statement.

Q. Which is the function of RBI?

Q. A software component