Question
a.
Counting the maximum memory needed by the algorithm
b.
Counting the minimum memory needed by the algorithm
c.
Counting the average memory needed by the algorithm
d.
Counting the maximum disk space needed by the algorithm
Posted under Data Structures and Algorithms
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. The space factor when determining the efficiency of algorithm is measured by
Similar Questions
Discover Related MCQs
Q. Which of the following case does not exist in complexity theory
View solution
Q. The complexity of the average case of an algorithm is
View solution
Q. The complexity of linear search algorithm is
View solution
Q. The complexity of Binary search algorithm is
View solution
Q. The complexity of Bubble sort algorithm is
View solution
Q. The complexity of merge sort algorithm is
View solution
Q. Let A be an array of 31 numbers consisting of a sequence of 0’s followed by a sequence of 1’s. The problem is to find the smallest index i such that A[i] is 1 by probing the minimum number of locations in A. The worst case number of probes performed by an optimal algorithm is________.
View solution
Q. The complexity of multiplying two matrices of order m*n and n*p is
View solution
Q. Merging 4 sorted files containing 50, 10, 25 and 15 records will take____time.
View solution
Q. An algorithm is made up of two independent time complexities f (n) and g (n). Then the complexities of the algorithm is in the order of
View solution
Q. Ackerman’s function is defined on the non-negative integers as follows
a (m,n) = n+1 if m=0
= a (m-1, 1) if m ≠ 0, n=0
= a (m-1, a(m, n-1)) if m ≠ 0, n ≠ 0
The value of a (1, 3) is
View solution
Q. What is a set of steps for carrying out a specific task called?
View solution
Q. A real world example of an algorithm would be a___________.
View solution
Q. Who should know about the basic algorithmic toolbox structures that allow efficient organization and retrieval of data frequently used algorithms and basic techniques for modeling, understanding and solving algorithmic problems?
View solution
Q. Algorithms are at the heart of every non-trivial computer application and also a modern and active area of ____________.
View solution
Q. Operations performed on scalar quantities are termed simple, while operations on vector data normally termed as_______.
View solution
Q. An algorithm may have __________‘inputs’ quantities.
View solution
Q. ___________ refers to a finite set of steps, which, when followed, solves a particular problem.
View solution
Q. The two main resources that we consider for an algorithm are__________.
View solution
Q. Space complexity of an algorithm is the maximum amount of _______ required by it during execution.
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
