CS502-Midterm
1 / 50
Efficient algorithm requires less computational…….
2 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
3 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
4 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
5 / 50
Sorting can be in _________
6 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
7 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
8 / 50
Counting sort has time complexity:
9 / 50
_______________ is a graphical representation of an algorithm
10 / 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.
11 / 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.
12 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
13 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
14 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
15 / 50
In Quick Sort Constants hidden in T(n log n) are
16 / 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.
17 / 50
In ____________ we have to find rank of an element from given input.
18 / 50
Which may be stable sort:
19 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
20 / 50
The sieve technique works in ___________ as follows
21 / 50
For the Sieve Technique we take time
22 / 50
In which order we can sort?
23 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
24 / 50
Is it possible to sort without making comparisons?
25 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
26 / 50
The sieve technique is a special case, where the number of sub problems is just
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
Analysis of Selection algorithm ends up with,
29 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
30 / 50
Quick sort is
31 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
32 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
33 / 50
What is the total time to heapify?
34 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
35 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
36 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
37 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
38 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
39 / 50
______________ graphical representation of algorithm.
40 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
41 / 50
For the worst-case running time analysis, the nested loop structure containing one “for” and one “while” loop, might be expressed as a pair of _________nested summations.
42 / 50
43 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
44 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
45 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
46 / 50
In Heap Sort algorithm, if heap property is violated _________
47 / 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,
48 / 50
For the heap sort, access to nodes involves simple _______________ operations.
49 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
50 / 50
Algorithm is concerned with.......issues.
Your score is
The average score is 40%
Restart quiz
