If a problem can be solved by combining optimal solutions to non-overlapping problems, the strategy is called _____________ans.GreedyDynamic programmingDivide and conquerRecursion Previous Marked for Review Next

If a problem can be solved by combining optimal solutions to non-overlapping problems, the strategy is called _____________

If a problem can be solved by combining optimal solutions to non-overlapping problems, the strategy is called _____________ Dynamic programming  Greedy Divide and conquer  Recursion

f a problem can be solved by combining optimal solutions to non-overlapping problems, the strategy is called _____________

A greedy algorithm can be used to solve all the dynamic programming problems:1 pointTrueFalse

This algorithm design paradigm based on decomposition of problem into sub-problems. a. Recursive approach b. From zero to one c. Divide and Conquer d. Simplification e. Greedy algorithm