CS502-Midterm
1 / 50
______________ graphical representation of algorithm.
2 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
3 / 50
A heap is a left-complete binary tree that conforms to the ___________
4 / 50
After sorting in merge sort algorithm, merging process is invoked.
5 / 50
Counting sort has time complexity:
6 / 50
For the heap sort, access to nodes involves simple _______________ operations.
7 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
8 / 50
The function f(n)=n(logn+1)/2 is asymptotically equivalent to nlog n. Here Lower Bound means function f(n) grows asymptotically at ____________ as fast as nlog n.
9 / 50
When we call heapify then at each level the comparison performed takes time
10 / 50
For the sieve technique we solve the problem,
11 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
12 / 50
Which may be stable sort:
13 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
14 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
15 / 50
In Sieve Technique we do not know which item is of interest
16 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
17 / 50
In the analysis of Selection algorithm, we eliminate a constant fraction of the array with each phase; we get the convergent _______________ series in the analysis,
18 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
19 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
20 / 50
The running time of quick sort depends heavily on the selection of
21 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
22 / 50
Due to left complete nature of binary tree, the heap can be stored in
23 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
24 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
25 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
26 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
27 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
28 / 50
44.The running time of an algorithm would not depend upon the optimization by the compiler but that of an implementation of the algorithm would depend on it.
29 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
30 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
31 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
32 / 50
What type of instructions Random Access Machine (RAM) can execute?
33 / 50
In Quick Sort Constants hidden in T(n log n) are
34 / 50
How much time merge sort takes for an array of numbers?
35 / 50
Algorithm is concerned with.......issues.
36 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
37 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
38 / 50
Consider the following code:
For(j=1; j
For(k=1; k<15;k++)
For(l=5; l
{
Do_something_constant();
}
What is the order of execution for this code.
39 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
40 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
41 / 50
For the Sieve Technique we take time
42 / 50
The sieve technique works in ___________ as follows
43 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
44 / 50
One example of in place but not stable algorithm is
45 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
46 / 50
47 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
48 / 50
Quick sort is best from the perspective of Locality of reference.
49 / 50
Slow sorting algorithms run in,
50 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
Your score is
The average score is 40%
Restart quiz
