CS502-Midterm
1 / 50
Which may be a stable sort?
2 / 50
For the sieve technique we solve the problem,
3 / 50
A heap is a left-complete binary tree that conforms to the ___________
4 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
5 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
6 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
7 / 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.
8 / 50
In RAM model instructions are executed
9 / 50
In Sieve Technique we do not know which item is of interest
10 / 50
For the heap sort, access to nodes involves simple _______________ operations.
11 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
12 / 50
13 / 50
Quick sort is
14 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
15 / 50
What type of instructions Random Access Machine (RAM) can execute?
16 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
17 / 50
When we call heapify then at each level the comparison performed takes time
18 / 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,
19 / 50
Due to left complete nature of binary tree, the heap can be stored in
20 / 50
How much time merge sort takes for an array of numbers?
21 / 50
Slow sorting algorithms run in,
22 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
23 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
24 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
25 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
26 / 50
In Quick Sort Constants hidden in T(n log n) are
27 / 50
In which order we can sort?
28 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
29 / 50
Analysis of Selection algorithm ends up with,
30 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
31 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
32 / 50
Which may be stable sort:
33 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
34 / 50
Sieve Technique can be applied to selection problem?
35 / 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.
36 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
37 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
38 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
39 / 50
The number of nodes in a complete binary tree of height h is
40 / 50
The O-notation is used to state only the asymptotic ________bounds.
41 / 50
In simple brute-force algorithm, we give no thought to efficiency.
42 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
43 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
44 / 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.
45 / 50
One Example of in place but not stable sort is
46 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
47 / 50
Divide-and-conquer as breaking the problem into a small number of
48 / 50
Random access machine or RAM is a/an
49 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
50 / 50
The sieve technique works in ___________ as follows
Your score is
The average score is 40%
Restart quiz
