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

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

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

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

5. Random access machine or RAM is a/an

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

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

8. Is it possible to sort without making comparisons?

9. Mergesort is a stable algorithm but not an in-place algorithm

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

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

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

13. 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.

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. Counting sort the numbers to be sorted are in the range 1 to k where k is small.

16. ______________ graphical representation of algorithm.

17. The Knapsack problem belongs to the domain of _______________ problems.

18. Due to left complete nature of binary tree, the heap can be stored in

19. What is the total time to heapify?

20. 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.

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

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

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

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

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

26. In 2d-space a point is said to be ________if it is not dominated by any other point in that space.

27. Algorithm is concerned with.......issues.

28. In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.

29. In RAM model instructions are executed

30. For the Sieve Technique we take time