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.

Related MCQs

Q. The primary unbalanced force is maximum when the angle of inclination of the crank with the line of stroke is

Q. With regard to a word processing software, the process of combining static information in a publication together with variable information in a data s

Q. What is the time complexity of Z algorithm for pattern searching (m = length of text, n = length of pattern)?

Q. The prefix on IC's indicates a broader operating temperature range, and the devices are generally used by the military.

Q. The logic 0 level of a CMOS logic device is approximately

Q. ________establishes the existence of errors _______locates and corrects the errors.

Q. What is the space complexity of program to reverse stack recursively?

Q. If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what ord

Q. An exception is

Q. Effective Storage management does not include __________