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.
Look at the following sequence of symbols to find the pattern. Select the symbol which completes the correct pattern:
Select the option in which the given figure is embedded (rotation is not allowed).Â
Kishore, Aashay, Swapan, Atul, Varun and Harshit are sitting around a round table facing the centre. Varun is sitting to the immediate right of Kishore,...
Select the option that is related to the third term on the same basis as the second term is related to the first term.
DAX:WZC ∷ VKO:?
Five friends Amit, Bipin, Chandan, Dinesh and Edwin are sitting on a beach. Amit is sitting next to Bipin, Chandan is sitting next to Dinesh is not sitt...
Select the figure that will come next in the following figure series.
In a certain code language,
A # B means A is the sister of B.
A @ B means A is the son of B.
A & B means A is the wife of B.
Which letter-cluster will complete the given series?
BHERZ, DGHTX, FFKVV, _________
