adplus-dvertising
frame-decoration

Question

An algorithm that indicates the amount of temporary storage required for running the algorithm, i.e., the amount of memory needed by the algorithm to run to completion is termed as_____.

a.

Big Theta θ (f)

b.

Space complexity

c.

Big Oh O (f)

d.

None of the above

Answer: (b).Space complexity

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. An algorithm that indicates the amount of temporary storage required for running the algorithm, i.e., the amount of memory needed by the algorithm to run to completion is termed...

Similar Questions

Discover Related MCQs

Q. The amount of time the computer needs to run to completion is known as_____.

Q. ___________algorithm is one which utilizes minimum processor time and requires minimum memory space during its execution.

Q. In simple terms, we can say that an algorithm is a step-by-step procedure for performing some task in a finite amount of time. State if the statement is true or false.

Q. Each operation must have a definite meaning and it must be perfectly clear. All steps of an algorithm need to be precisely defined. The actions to be executed in each case should be _____________.

Q. In general, a problem may be defined as a state of thing that is not in the___________.

Q. An algorithm that requires ................... operations to complete its task on n data elements is said to have a linear runtime.

Q. The complexity of adding two matrices of order m*n is

Q. lg (n!) = .................

Q. Which of the following uses memorization?

Q. An algorithm is made up of 2 modules M1&M2.; If order of M1 is f(n) & M2 is g(n) then the order of algorithm is?

Q. An array of n numbers is given, where n is an even number. The maximum as well as the minimum of these n numbers needs to be determined. Which of the following is TRUE about the number of comparisons needed?

Q. The running time of an algorithm T(n),where 'n' is the input size, of a recursive algorithm is given as follows.is given by T(n) =c + T(n - 1), if n > 1 d, if n ≤ 1 The order of this algorithm is

Q. Six files Fl, F2, F3, F4, F5 and F6 have 100,200,50,80, 120, 150 number of records respectively. In what order should they be stored so as to optimize access time? Assume each file is accessed with the same frequency.

Q. An algorithm is made up of 2 modules Ml and M2. If order of M1 is f(n) and M2 is g(n) then the order of the algorithm is

Q. The order of an algorithm that finds whether a given Boolean function of 'n' variables, produces a 1 is

Q. The running time of an algorithm is given by T(n) = T(n - 1) + T(n - 2) - T(n - 3), if n > 3 n, otherwise.

Q. A text is made up of the characters a, b, c, d, e each occurring with the probability .12, .4, .15, .08 and .25 respectively. The optimal coding technique will have the average length of

Q. The time complexity of an algorithm T(n), where n is the input size, is given by T( n) = T( n - 1) + 1/n if n > 1 The order of this algorithm is

Q. The concept of order (Big O) is important because

Q. Which of the following sorting algorithms does not have a worst case running time of O(n2)?