Explain the memory function method, Data Structure & Algorithms

Explain the Memory Function method

The Memory Function method seeks to combine strengths of the top  down and bottom-up approaches  to  solving  problems  with  overlapping  subproblems.  It does this  by  solving,  in  the  top-down fashion but only once, just essential sub problems of a given problem and recording their solutions in a table.  

 

Posted Date: 7/27/2013 5:57:43 AM | Location : United States







Related Discussions:- Explain the memory function method, Assignment Help, Ask Question on Explain the memory function method, Get Answer, Expert's Help, Explain the memory function method Discussions

Write discussion on Explain the memory function method
Your posts are moderated
Related Questions
Q. What do you understand by the tree traversal? Write down the procedure for traversing a binary tree in preorder and execute it on the following tree.    Ans: Th

The below formula is used to calculate n: n = (x * x)/ (1 - x). Value x = 0 is used to stop the algorithm. Calculation is repeated using values of x until value x = 0 is input. The

1) What will call a graph that have no cycle? 2) Adjacency matrix of an undirected graph is------------- on main diagonal. 3) Represent the following graphs by adjacency matr

When writing a code for a program that basically answers Relative Velocity questions how do you go at it? How many conditions should you go through?

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

To delete an element in the list at the end, we can delete it without any difficult. But, assume if we desire to delete the element at the straining or middle of the list, then, we

What are the languages which support assertions Languages which support assertions often provide different levels of support. For instance, Java has an assert statement which t

characteristics of a good algorithm

Q. Write  down the  algorithm  to  insert  an  element  to  a  max-heap  which  is  represented sequentially.           Ans: The algorithm to insert an element "newkey" to

how to write prims algorithms? with example