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
In the array implementation of lists, elements are stored into continuous locations. In order to add an element into the list at the end, we can insert it without any problem. But,

This question is based on the requirements of a system to record band bookings at gigs. (A 'gig' is an event at which one or more bands are booked to play). You do not need to know

Question 1 . Give the structure of PL/SQL Blocks and explain Question 2 . Differentiate between PL/SQL functions and procedures Question 3 . Explain the following Par

How can the third dimension be displayed on the screen The main problem in visualization is the display of three-dimensional objects and scenes on two-dimensional screens. How

Write an algorithm to print all even numbers in descending order and draw the flowchart

Q. What do you understand by the term by hash clash? Explain in detail any one method to resolve the hash collisions.

Q. Describe what do you understand by the term array? How does an array vary from an ordinary variable? How are the arrays represented in the specific memory?

Programming for hash table?

Q. Construct a complete binary tree with depth 3 for this tree which is maintained in the memory using the linked representation. Make the adjacency list and adjacency matrix for t

Merging 4 sorted files having 50, 10, 25 and 15 records will take time  O (100)