CS502-Midterm
1 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
2 / 50
Cont sort is suitable to sort the elements in range 1 to k
3 / 50
Analysis of Selection algorithm ends up with,
4 / 50
For the heap sort we store the tree nodes in
5 / 50
Which may be stable sort:
6 / 50
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.
7 / 50
The number of nodes in a complete binary tree of height h is
8 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
9 / 50
In Sieve Technique we do not know which item is of interest
10 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
11 / 50
_______________ is a graphical representation of an algorithm
12 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
13 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
14 / 50
Divide-and-conquer as breaking the problem into a small number of
15 / 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.
16 / 50
Is it possible to sort without making comparisons?
17 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
18 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
19 / 50
The O-notation is used to state only the asymptotic ________bounds.
20 / 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.
21 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
22 / 50
Counting sort has time complexity:
23 / 50
In Quick Sort Constants hidden in T(n log n) are
24 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
25 / 50
For the heap sort, access to nodes involves simple _______________ operations.
26 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
27 / 50
Sorting can be in _________
28 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
29 / 50
After sorting in merge sort algorithm, merging process is invoked.
30 / 50
How much time merge sort takes for an array of numbers?
31 / 50
Random access machine or RAM is a/an
32 / 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.
33 / 50
In which order we can sort?
34 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
35 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
36 / 50
______________ graphical representation of algorithm.
37 / 50
Efficient algorithm requires less computational…….
38 / 50
39 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
40 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
41 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
42 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
43 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
44 / 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,
45 / 50
What type of instructions Random Access Machine (RAM) can execute?
46 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
47 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
48 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
49 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
50 / 50
Your score is
The average score is 40%
Restart quiz
