CS502-Midterm
1 / 50
Quick sort is best from the perspective of Locality of reference.
2 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
3 / 50
The sieve technique is a special case, where the number of sub problems is just
4 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
5 / 50
For the heap sort we store the tree nodes in
6 / 50
Efficient algorithm requires less computational…….
7 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
8 / 50
The running time of quick sort depends heavily on the selection of
9 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
10 / 50
The sieve technique works in ___________ as follows
11 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
12 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
13 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
14 / 50
Counting sort has time complexity:
15 / 50
Random access machine or RAM is a/an
16 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
17 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
18 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
19 / 50
Which may be stable sort:
20 / 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,
21 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
22 / 50
For the heap sort, access to nodes involves simple _______________ operations.
23 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
24 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
25 / 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.
26 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
27 / 50
What is the total time to heapify?
28 / 50
29 / 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.
30 / 50
When we call heapify then at each level the comparison performed takes time
31 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
32 / 50
For the Sieve Technique we take time
33 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
34 / 50
The O-notation is used to state only the asymptotic ________bounds.
35 / 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.
36 / 50
One example of in place but not stable algorithm is
37 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
38 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
39 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
40 / 50
After sorting in merge sort algorithm, merging process is invoked.
41 / 50
Algorithm is concerned with.......issues.
42 / 50
Quick sort is
43 / 50
44 / 50
Is it possible to sort without making comparisons?
45 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
46 / 50
_______________ is a graphical representation of an algorithm
47 / 50
How much time merge sort takes for an array of numbers?
48 / 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.
49 / 50
Which may be a stable sort?
50 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
Your score is
The average score is 40%
Restart quiz
