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
how can i delete from deque while deletion is restricted from one end

Write an algorithm for searching a key from a sorted list using binary search technique 1.   if (low > high) 2.     return (-1) 3.    mid = (low +high)/2; 4    .if ( X

how multiple stacks can be implemented using one dimensional array

(a) Discuss the role played by Business Intelligence Systems in giving companies strategic advantage. (b) Explain the term heuristics searching . (c) With the use of an appr

Explain about the Abstract data type Abstract data type (ADT) A set of values (the carrier set) and operations on those values

What values are automatically assigned to those array elements which are not explicitly initialized? Garbage values are automatically assigned to those array elements that

Inorder traversal: The left sub tree is visited, then the node and then right sub-tree. Algorithm for inorder traversal is following: traverse left sub-tree visit node

1. The following is a recursive algorithm to calculate the k -th power of 2. Input k a natural number Output kth power of 2 Algorithem: If k =0then return 1 Else return 2* po

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

Linked lists are among the most common and easiest data structures. They may be used to implement various other common abstract data types, including queues, stacks, symbolic expre