CS502-Midterm
1 / 50
What is the total time to heapify?
2 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
3 / 50
One Example of in place but not stable sort is
4 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
5 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
6 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
7 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
8 / 50
Which sorting algorithm is faster
9 / 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.
10 / 50
The Knapsack problem belongs to the domain of _______________ problems.
11 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
12 / 50
What type of instructions Random Access Machine (RAM) can execute?
13 / 50
When we call heapify then at each level the comparison performed takes time
14 / 50
_______________ is a graphical representation of an algorithm
15 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
16 / 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,
17 / 50
A RAM is an idealized machine with ______________ random-access memory.
18 / 50
Sieve Technique can be applied to selection problem?
19 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
20 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
21 / 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.
22 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
23 / 50
For the sieve technique we solve the problem,
24 / 50
Is it possible to sort without making comparisons?
25 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
26 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
27 / 50
Cont sort is suitable to sort the elements in range 1 to k
28 / 50
The running time of quick sort depends heavily on the selection of
29 / 50
Random access machine or RAM is a/an
30 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
31 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
32 / 50
For the Sieve Technique we take time
33 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
34 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
35 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
36 / 50
In Sieve Technique we do not know which item is of interest
37 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
38 / 50
The sieve technique works in ___________ as follows
39 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
40 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
41 / 50
Efficient algorithm requires less computational…….
42 / 50
Which may be stable sort:
43 / 50
Divide-and-conquer as breaking the problem into a small number of
44 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
45 / 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.
46 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
47 / 50
48 / 50
In Quick Sort Constants hidden in T(n log n) are
49 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
50 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
Your score is
The average score is 40%
Restart quiz
