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

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

Kruskal’s algorithm is a ______Select one:a.divide and conquer algorithmb.dynamic programming algorithmc. greedy algorithmd.approximation algorithm

Partition the problem into independent sub-problems•Solve the sub-problems recursively•Combine the solutions to solve the original problem, These are the steps of1 pointBrute ForceDivide and ConquerDynamic ProgrammingGreedy Approach

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

Fractional knapsack problem is solved most efficiently by which of the following algorithm?Question 4Answera.Backtrackingb.Greedy algorithmc.Dynamic programmingd.Divide and conquer