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
The two famous methods for traversing are:- a) Depth first traversal b) Breadth first

Define Hashing. Store the following values in a hash table of table size 11 using division method: 25, 42, 96, 101, 102, 162, and 197. In case of collision, use other hash functio

Write an assembly program to separate the number of positive numbers and negative numbers from a given series of signed numbers.

Write an algorithm to calculate a postfix expression.  Execute your algorithm using the given postfix expression as your input : a b + c d +*f ↑ . T o evaluate a postfix expr

(a) Explain the term Group Support System and elaborate on how it can improve groupwork. (b) Briefly explain three advantages of simulation. (c) Explain with the help of a

Area Subdivision Method In this method, the viewport is examined for clear decisions on the polygons situated in it, in regard to their overlap and visibility to the viewer. Fo

INSERT FUNCTION /*prototypes of insert & find functions */ list * insert_list(list *); list * find(list *, int); /*definition of  anyinsert function */ list * inser

What is an algorithm?  What are the characteristics of a good algorithm? An algorithm is "a step-by-step process for accomplishing some task'' An algorithm can be given in many

B-trees are special m-ary balanced trees utilized in databases since their structure allows records to be added, deleted & retrieved with guaranteed worst case performance. A B-

how we can convert a graph into tree