Complexity, Data Structure & Algorithms

Complexity: How do the resource needs of a program or algorithm scale (the growth of resource requirements as a function of input). In other words, what happens with the performance of an algorithm, as the size of the difficulty being solved gets larger & larger? For instance, the time & memory requirement of an algorithm that computes the sum of 1000 numbers is larger than the algorithm that computes the sum of 2 numbers.

Time Complexity: The maximum time needed through a Turing machine to execute on any input of length n.

Space Complexity: The amount of storage space needed by an algorithm varies along the size of the problem being solved out. Normally the space complexity is expressed as an order of magnitude of the size of the problem, for example (n2) means that if the size of the problem (n) doubles then the working storage (memory) needs will become four times.

Posted Date: 4/4/2013 5:47:56 AM | Location : United States







Related Discussions:- Complexity, Assignment Help, Ask Question on Complexity, Get Answer, Expert's Help, Complexity Discussions

Write discussion on Complexity
Your posts are moderated
Related Questions

Ask queConsider the following functional dependencies: Applicant_ID -> Applicant_Name Applicant_ID -> Applicant_Address Position_ID -> Positoin_Title Position_ID -> Date_Position_O

Q. Describe what do you understand by the term array? How does an array vary from an ordinary variable? How are the arrays represented in the specific memory?

Q .  Write down the non-recursive algorithm to traverse a tree in preorder. Ans: T he Non- Recursive algorithm for preorder traversal is written below: Initially i

how to write a function of area of a circle using python

Write the algorithm for compound interest

Explain the theory of computational complexity A  problem's  intractability  remains  the  similar  for  all  principal  models  of   computations    and   all reasonable inpu

1. Write a pseudocode algorithm to print the numbers from 1 to 10, and then from 10 to 1, using exactly one loop. 2. The function contains() takes a food as an argument and tell

Q. A linear array A is given with lower bound as 1. If address of A[25] is 375 and A[30] is 390, then find address of A[16].

Problem Your LC code is stored in a memory location as shown and the variable name is LC                  LC Memory address       Content(LC code)