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
Records are mapped onto a computer store by simply juxtaposing their elements. The address of a component (field) r relative to the origin address of the record r is named the fiel

Program: Creation of a Circular linked list ALGORITHM (Insertion of an element into a Circular Linked List) Step 1        Begin Step 2      if the list is empty or new

Write an algorithm for getting solution to the Tower's of Hanoi problem. Explain the working of your algorithm (with 4 disks) with appropriate diagrams. Ans: void Hanoi(int

There are three kinds of tree traversals, namely, Postorder , Preorder and Inorder. Preorder traversal: Each of nodes is visited before its children are visited; first the roo

Which sorting algorithms does not have a worst case running time of  O (n 2 ) ? Merge sort

Tree is dynamic data structures. Trees can expand & contract as the program executes and are implemented via pointers. A tree deallocates memory whereas an element is deleted.

Efficiency of Linear Search How much number of comparisons is there in this search in searching for a particular element? The number of comparisons based upon where the reco

In this sorting algorithm, multiple swapping occurs in one pass. Smaller elements move or 'bubble' up to the top of the list, so the name given to the algorithm. In this method,

1)      Why space complexity is comparatively more critical than time complexity? 2)      Determine the space complexity of Euclid Algorithm?

Acyclic Graphs In a directed graph a path is said to form a cycle is there exists a path (A,B,C,.....P) such that A = P. A graph is called acyclic graph if there is no cycle in