CS502-Midterm
1 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
2 / 50
In Quick Sort Constants hidden in T(n log n) are
3 / 50
For the Sieve Technique we take time
4 / 50
Sorting can be in _________
5 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
6 / 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.
7 / 50
Random access machine or RAM is a/an
8 / 50
Which may be a stable sort?
9 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
10 / 50
Sieve Technique can be applied to selection problem?
11 / 50
One example of in place but not stable algorithm is
12 / 50
In which order we can sort?
13 / 50
_______________ is a graphical representation of an algorithm
14 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
15 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
16 / 50
Algorithm is concerned with.......issues.
17 / 50
Counting sort has time complexity:
18 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
19 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
20 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
21 / 50
In RAM model instructions are executed
22 / 50
In Sieve Technique we do not know which item is of interest
23 / 50
In plane sweep approach, a vertical line is swept across the 2d-plane and _______structure is used for holding the maximal points lying to the left of the sweep line.
24 / 50
Quick sort is best from the perspective of Locality of reference.
25 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
26 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
27 / 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.
28 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
29 / 50
30 / 50
For the heap sort, access to nodes involves simple _______________ operations.
31 / 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.
32 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
33 / 50
34 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
35 / 50
The O-notation is used to state only the asymptotic ________bounds.
36 / 50
______________ graphical representation of algorithm.
37 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
38 / 50
Upper bound requires that there exist positive constants c2 and n0 such that f(n) ____ c2n for all n <= n0(ye question ghalat lag raha hai mujhae
39 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
40 / 50
The sieve technique works in ___________ as follows
41 / 50
42 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
43 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
44 / 50
A heap is a left-complete binary tree that conforms to the ___________
45 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
46 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
47 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
48 / 50
Which may be stable sort:
49 / 50
Efficient algorithm requires less computational…….
50 / 50
One Example of in place but not stable sort is
Your score is
The average score is 40%
Restart quiz
