CS502-Midterm
1 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
2 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
3 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
4 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
5 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
6 / 50
After sorting in merge sort algorithm, merging process is invoked.
7 / 50
Random access machine or RAM is a/an
8 / 50
For the Sieve Technique we take time
9 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
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 Sieve Technique we do not know which item is of interest
12 / 50
In Heap Sort algorithm, if heap property is violated _________
13 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
14 / 50
15 / 50
_______________ is a graphical representation of an algorithm
16 / 50
Sieve Technique can be applied to selection problem?
17 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
18 / 50
Cont sort is suitable to sort the elements in range 1 to k
19 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
20 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
21 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
22 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
23 / 50
In RAM model instructions are executed
24 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
25 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
26 / 50
What is the total time to heapify?
27 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
28 / 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,
29 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
30 / 50
In ____________ we have to find rank of an element from given input.
31 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
32 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
33 / 50
How much time merge sort takes for an array of numbers?
34 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
35 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
36 / 50
The running time of quick sort depends heavily on the selection of
37 / 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.
38 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
39 / 50
The sieve technique works in ___________ as follows
40 / 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.
41 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
42 / 50
A heap is a left-complete binary tree that conforms to the ___________
43 / 50
44 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
45 / 50
In which order we can sort?
46 / 50
The sieve technique is a special case, where the number of sub problems is just
47 / 50
Which sorting algorithm is faster
48 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
49 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
50 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
Your score is
The average score is 40%
Restart quiz
