CS502-Midterm
1 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
2 / 50
Random access machine or RAM is a/an
3 / 50
If we associate (x, y) integers pair to cars where x is the speed of the car and y is the negation of the price. High y value for a car means a ________ car.
4 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
5 / 50
In Sieve Technique we do not know which item is of interest
6 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
7 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
8 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
9 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
10 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
11 / 50
Sieve Technique can be applied to selection problem?
12 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
13 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
14 / 50
Slow sorting algorithms run in,
15 / 50
When we call heapify then at each level the comparison performed takes time
16 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
17 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
18 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
19 / 50
One example of in place but not stable algorithm is
20 / 50
21 / 50
22 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
23 / 50
The O-notation is used to state only the asymptotic ________bounds.
24 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
25 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
26 / 50
The sieve technique is a special case, where the number of sub problems is just
27 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
28 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
29 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
30 / 50
Quick sort is best from the perspective of Locality of reference.
31 / 50
In ____________ we have to find rank of an element from given input.
32 / 50
The running time of quick sort depends heavily on the selection of
33 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
34 / 50
In RAM model instructions are executed
35 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
36 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
37 / 50
How much time merge sort takes for an array of numbers?
38 / 50
Analysis of Selection algorithm ends up with,
39 / 50
For the Sieve Technique we take time
40 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
41 / 50
Which may be a stable sort?
42 / 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,
43 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
44 / 50
In Heap Sort algorithm, if heap property is violated _________
45 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
46 / 50
Algorithm is concerned with.......issues.
47 / 50
After sorting in merge sort algorithm, merging process is invoked.
48 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
49 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
50 / 50
______________ graphical representation of algorithm.
Your score is
The average score is 40%
Restart quiz
