CS502-Midterm
1 / 50
Efficient algorithm requires less computational…….
2 / 50
Cont sort is suitable to sort the elements in range 1 to k
3 / 50
Quick sort is best from the perspective of Locality of reference.
4 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
5 / 50
A RAM is an idealized machine with ______________ random-access memory.
6 / 50
Which may be a stable sort?
7 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
8 / 50
In Heap Sort algorithm, if heap property is violated _________
9 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
10 / 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.
11 / 50
In Quick Sort Constants hidden in T(n log n) are
12 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
13 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
14 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
15 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
16 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
17 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
18 / 50
19 / 50
Divide-and-conquer as breaking the problem into a small number of
20 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
21 / 50
For the sieve technique we solve the problem,
22 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
23 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
24 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
25 / 50
For the heap sort we store the tree nodes in
26 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
27 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
28 / 50
Sorting can be in _________
29 / 50
The Knapsack problem belongs to the domain of _______________ problems.
30 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
31 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
32 / 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
33 / 50
In Sieve Technique we do not know which item is of interest
34 / 50
The O-notation is used to state only the asymptotic ________bounds.
35 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
36 / 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,
37 / 50
How much time merge sort takes for an array of numbers?
38 / 50
One example of in place but not stable algorithm is
39 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
40 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
41 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
42 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
43 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
44 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
45 / 50
46 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
47 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
48 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
49 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
50 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
Your score is
The average score is 40%
Restart quiz
