CS502-Midterm
1 / 50
Which may be a stable sort?
2 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
3 / 50
The O-notation is used to state only the asymptotic ________bounds.
4 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
5 / 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.
6 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
7 / 50
The running time of quick sort depends heavily on the selection of
8 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
9 / 50
Is it possible to sort without making comparisons?
10 / 50
______________ graphical representation of algorithm.
11 / 50
In RAM model instructions are executed
12 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
13 / 50
In Sieve Technique we do not know which item is of interest
14 / 50
In ____________ we have to find rank of an element from given input.
15 / 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.
16 / 50
The Knapsack problem belongs to the domain of _______________ problems.
17 / 50
What is the total time to heapify?
18 / 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.
19 / 50
Random access machine or RAM is a/an
20 / 50
Quick sort is best from the perspective of Locality of reference.
21 / 50
For the Sieve Technique we take time
22 / 50
The number of nodes in a complete binary tree of height h is
23 / 50
Which may be stable sort:
24 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
25 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
26 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
27 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
28 / 50
Divide-and-conquer as breaking the problem into a small number of
29 / 50
One example of in place but not stable algorithm is
30 / 50
Which sorting algorithm is faster
31 / 50
How much time merge sort takes for an array of numbers?
32 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
33 / 50
Sieve Technique can be applied to selection problem?
34 / 50
Quick sort is
35 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
36 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
37 / 50
Due to left complete nature of binary tree, the heap can be stored in
38 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
39 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
40 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
41 / 50
In Quick Sort Constants hidden in T(n log n) are
42 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
43 / 50
In Heap Sort algorithm, if heap property is violated _________
44 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
45 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
46 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
47 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
48 / 50
The sieve technique is a special case, where the number of sub problems is just
49 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
50 / 50
Sorting can be in _________
Your score is
The average score is 40%
Restart quiz
