Define dynamic programming, Data Structure & Algorithms

Define Dynamic Programming

 Dynamic  programming  is  a  method  for  solving  problems  with  overlapping  problems.  Typically, these sub problems arise from a recurrence relating a solution to a given problem with solutions to its smaller sub problems of the similar type.  Rather than solving   overlapping   subproblems  again  and  again,  dynamic programming suggests solving every of the smaller sub problems only once and recording the results in a table from which we can then get a solution to the original problem.  

 

Posted Date: 7/27/2013 5:51:32 AM | Location : United States







Related Discussions:- Define dynamic programming, Assignment Help, Ask Question on Define dynamic programming, Get Answer, Expert's Help, Define dynamic programming Discussions

Write discussion on Define dynamic programming
Your posts are moderated
Related Questions
Q. Explain Dijkstra's algorithm for finding the shortest path in the graph given to us.  Ans: The Dijkstra's algorithm: This is a problem which is concerned with finding

Draw trace table and determine output from the following flowchart using following data: Number = 45, -2, 20.5

Explain an efficient method of storing a sparse matrix in memory. Write a module to find the transpose of the sparse matrix stored in this way. A matrix which contains number o

Q. Perform implementation of a queue using a singly linked list L. The operations INSER and DELETE should take O (1) time.

State the example of pre- and post-conditions Suppose that function f(x) should have a non-zero argument and return a positive value. We can document these pre- and post-condit

Define Wire-frame Model This skeletal view is called a Wire-frame Model. Although not a realistic representation  of the object, it is still very useful in the early stages of

create aset of ten numbers.then you must divide it into two sets numbers which are set of odd numbers and set of even numbers.

what are grounded header linked lists?

Approximating smooth surfaces with Polygon nets Networks of polygons are used to represent smooth surfaces. They are, of course, only an approximation to the true surface, but

Suppose there are exactly five packet switches (Figure 4) between a sending host and a receiving host connected by a virtual circuit line (shown as dotted line in figure 4). The tr