Question
Divide and conquer partition a problem into independent
smaller sub problems, whereas dynamic programming partition a problem into overlapping sub-problem.Solution
Divide & Conqure Dynamic Programming Partition a problem into independent smaller sub problems Partition a problem into overlapping smaller sub problems Doesnt store solution of sub-problems.(identical sub-problems may arisse-results in the same computations are performed repeatedly.) stores solution of sub-problems : thus avoids calculations of same quantity twice Top down alogithms : which logically progresses from the initial instance down to the smallest sub- instances. Bottom up algorithms : in which the smallest sub-problems are explicity solved first and the results of the used to construct solutions to progressively larger sub-instances.
Which sorting algorithm divides the array into halves recursively?
In dynamic programming, which principle ensures correctness by solving overlapping subproblems and storing results?
Which of the following operations on a data structure refers to the removal of an element from the front of a queue?
Which of the following algorithms is most appropriate for a sorting task that requires minimal auxiliary space?
In mobile computing, what is the main feature of pervasive computing?
Which of the following is true for the time complexity of binary search?
Recursive problems are implemented by
Which of the following algorithms uses a greedy approach?
The time complexity of computing the all-pairs shortest paths in a dense graph with V vertices using Floyd–Warshall is:
In dynamic programming, overlapping subproblems and _________ are key properties.
