Question
a.
f (n) + g (n)
b.
f (n) x g (n )
c.
min (f (n) ,g (n) )
d.
max (f (n) ,g (n))
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. 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
Similar Questions
Discover Related MCQs
Q. The order of an algorithm that finds whether a given Boolean function of 'n' variables, produces a 1 is
View solution
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.
View solution
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
View solution
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
View solution
Q. The concept of order (Big O) is important because
View solution
Q. Which of the following sorting algorithms does not have a worst case running time of O(n2)?
View solution
Q. Using the standard algorithm, what is the time required to determine that a number n is prime ?
View solution
Q. Let m, n be positive integers. Define Q (m, n) as Q (m, n) = 0, if m>n Then Q (m, 3) is (a div b, gives the quotient when a is divided by b)
View solution
Q. The worst case occur in quick sort when
View solution
Q. What does it mean when we say that an algorithm X is asymptotically more efficient than Y?
View solution
Q. The complexity of Fibonacci series is
View solution
Q. The worst case complexity for insertion sort is
View solution
Q. The worst case complexity of quick sort is
View solution
Q. To measure Time complexity of an algorithm Big O notation is used which:
View solution
Q. If for an algorithm time complexity is given by O(1) then complexity of it is:
View solution
Q. If for an algorithm time complexity is given by O(log2n) then complexity will:
View solution
Q. If for an algorithm time complexity is given by O(n) then complexity of it is:
View solution
Q. If for an algorithm time complexity is given by O(n²) then complexity will:
View solution
Q. If for an algorithm time complexity is given by O((3/2)ⁿ) then complexity will:
View solution
Q. The time complexity of binary search is given by:
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!
