The space - time trade off, Data Structure & Algorithms

The best algorithm to solve a given problem is one that requires less space in

memory and takes less time to complete its execution. But in practice it is not always possible to achieve both of these objectives. There may be more than one approach to solve a problem. One approach may require more space but less time to complete its execution. The 2nd approach may require less space but takes more time to complete execution. We choose 1st approach if time is a constraint and 2nd approach if space is a constraint. Thus we may have to sacrifice one at cost of the other.  That  is  what  we  can  say that  there  exists  a  time  space  trade  among algorithm.

 

 

Posted Date: 7/12/2012 9:22:16 AM | Location : United States







Related Discussions:- The space - time trade off, Assignment Help, Ask Question on The space - time trade off, Get Answer, Expert's Help, The space - time trade off Discussions

Write discussion on The space - time trade off
Your posts are moderated
Related Questions
There are ten stations on a railway line: Train travels in both directions (i.e. from 1 to 10 and then from 10 to 1).  Fare between each station is $2. A passenger input

Taking a suitable example explains how a general tree can be shown as a Binary Tree. Conversion of general trees to binary trees: A general tree can be changed into an equiv

Construct a B+ tree for the following keys, starting with an empty tree.  Each node in the tree can hold a maximum of 2 entries (i.e., order d = 1). Start with an empty root nod

The Linked list is a chain of structures wherein each structure contains data in addition to pointer, which stores the address (link) of the next logical structure in the list.

In the amortized analysis, the time needed to perform a set of operations is the average of all operations performed. Amortized analysis considers as a long sequence of operations

Graph terminologies : Adjacent vertices: Two vertices a & b are said to be adjacent if there is an edge connecting a & b. For instance, in given Figure, vertices 5 & 4 are adj

Q. Describe the term hashing. Explain any two usually used hash functions. Explain one method of collision resolution.

An advertising project manager developed the network diagram shown below for a new advertising campagign.  In addition, the manager gathered the time information for each activity,

In the array implementation of the lists, we will use the array to hold the entries and a separate counter to keep track of the number of positions are occupied. A structure will b

3. A function to convert a complex number in algebraic form to a complex number in phasor form