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
Write the algorithm for compound interest


Q. Which are the two standard ways of traversing a graph?  Explain them with an example of each.  Ans:   T he two ways of traversing a graph are written below

1. In computer science, a classic problem is how to dynamically store information so as to let for quick look up. This searching problem arises frequently in dictionaries, symbol t

A binary search tree is used to locate the number 43. Which of the following probe sequences are possible and which are not? Explain. (a) 61 52 14 17 40 43 (b) 2 3 50 40 60 43 (c)

Example which cause problems for some hidden-surface algorithms Some special cases, which cause problems for some hidden-surface algorithms, are penetrating faces and cyclic ov

Explain the concept of hidden lines The problem of hidden lines or surfaces was implicit even in 2-D graphics, but we did not mention it there, because what was intended to be

Define Complete Binary Tree Complete Binary Tree:- A whole binary tree of depth d is that strictly binary tree all of whose leaves are at level D.

A freight train from Melbourne is approaching Sydney, carrying n cars of cargos. The cargos are to be delivered to n different cities in the metropolitan area of Sydney - one car f

The two famous methods for traversing are:- a) Depth first traversal b) Breadth first