CS502-Midterm
1 / 50
For the heap sort we store the tree nodes in
2 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
3 / 50
The sieve technique is a special case, where the number of sub problems is just
4 / 50
In simple brute-force algorithm, we give no thought to efficiency.
5 / 50
Random access machine or RAM is a/an
6 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
7 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
8 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
9 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
10 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
11 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
12 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
13 / 50
For the Sieve Technique we take time
14 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
15 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
16 / 50
Algorithm is concerned with.......issues.
17 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
18 / 50
Which may be a stable sort?
19 / 50
Quick sort is best from the perspective of Locality of reference.
20 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
21 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
22 / 50
In Heap Sort algorithm, if heap property is violated _________
23 / 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.
24 / 50
After sorting in merge sort algorithm, merging process is invoked.
25 / 50
Is it possible to sort without making comparisons?
26 / 50
A heap is a left-complete binary tree that conforms to the ___________
27 / 50
In Sieve Technique we do not know which item is of interest
28 / 50
Sorting can be in _________
29 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
30 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
31 / 50
Sieve Technique can be applied to selection problem?
32 / 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,
33 / 50
In ____________ we have to find rank of an element from given input.
34 / 50
What is the total time to heapify?
35 / 50
Quick sort is
36 / 50
One Example of in place but not stable sort is
37 / 50
Analysis of Selection algorithm ends up with,
38 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
39 / 50
In Quick Sort Constants hidden in T(n log n) are
40 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
41 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
42 / 50
43 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
44 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
45 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
46 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
47 / 50
Cont sort is suitable to sort the elements in range 1 to k
48 / 50
49 / 50
How much time merge sort takes for an array of numbers?
50 / 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.
Your score is
The average score is 40%
Restart quiz
