Q. Interpolation search is an improved variant of binary search. It is necessary for this search algorithm to work that −

View solution

Q. If the array is already sorted, which of these algorithms will exhibit the best performance

View solution

Q. Which of these algorithmic approach tries to achieve localized optimum solution −

View solution

Q. Apriori analysis of an algorithm assumes that −

View solution

Q. What is the worst case run-time complexity of binary search algorithm?

View solution

Q. Apriory algorithm analysis does not include −

View solution

Q. Time complexity of Depth First Traversal of is

View solution

Q. Travelling salesman problem is an example of

View solution

Q. Project scheduling is an example of

View solution

Q. Which of the following is an example of dynamic programming approach?

View solution

Q. Which of the following uses memoization?

View solution

Q. Which of the following asymptotic notation is the worst among all?

View solution

Q. Minimum number of moves required to solve a Tower of Hanoi puzzle is

View solution

Q. Program with highest run-time complexity is

View solution

Q. The time complexity of quick sort is …………..

View solution

Q. Two main measures for the efficiency of an algorithm are

View solution

Q. The time factor when determining the efficiency of algorithm is measured by

View solution

Q. The space factor when determining the efficiency of algorithm is measured by

View solution

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