1. In Quick sort, we don’t have the control over the sizes of recursive calls

2. In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.

3. We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.

4. Brute-force algorithm uses no intelligence in pruning out decisions.

5. After sorting in merge sort algorithm, merging process is invoked.

6. The time assumed for each basic operation to execute on RAM model of computation is-----

7. What is the solution to the recurrence T(n) = T(n/2)+n .

8. F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.

9. For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.

10. When we call heapify then at each level the comparison performed takes time

11. A RAM is an idealized machine with ______________ random-access memory.

12. Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________

13. In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.

14. If we associate (x, y) integers pair to cars where x is the speed of the car and y is the negation of the price. High y value for a car means a ________ car.

15. Random access machine or RAM is a/an

16. In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the

17. What type of instructions Random Access Machine (RAM) can execute?

18. Consider the following code:
For(j=1; j<n;j++)
For(k=1; k<15;k++)
For(l=5; l<n; l++)
{
Do_something_constant();
}
What is the order of execution for this code.

19. In RAM model instructions are executed

20. What type of instructions Random Access Machine (RAM) can execute? Choose best answer

21. Consider the following Algorithm: Factorial (n){ if (n=1) return 1 else
return (n * Factorial(n-1)) }
Recurrence for the following algorithm is:

22. Asymptotic growth rate of the function is taken over_________ case running time.

23. Due to left-complete nature of binary tree, heaps can be stored in

24. 8n2 + 2n - 3 will eventually exceed c2*(n) no matter how large we make c2.

25. For Chain Matrix Multiplication we can not use divide and conquer approach because,

26. For the Sieve Technique we take time

27. Counting sort the numbers to be sorted are in the range 1 to k where k is small.

28. In simple brute-force algorithm, we give no thought to efficiency

29. If the indices passed to merge sort algorithm are not equal, the algorithm may return immediately

30. The function f(n)= n(logn+1)/2 is asymptotically equivalent to n log n. Here Upper Bound means the function f(n) grows asymptotically ____________ faster than n log n.