CS502-Midterm
1 / 50
Which may be stable sort:
2 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
3 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
4 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
5 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
6 / 50
Random access machine or RAM is a/an
7 / 50
In Heap Sort algorithm, if heap property is violated _________
8 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
9 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
10 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
11 / 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.
12 / 50
The O-notation is used to state only the asymptotic ________bounds.
13 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
14 / 50
Slow sorting algorithms run in,
15 / 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.
16 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
17 / 50
One example of in place but not stable algorithm is
18 / 50
Analysis of Selection algorithm ends up with,
19 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
20 / 50
How much time merge sort takes for an array of numbers?
21 / 50
In Sieve Technique we do not know which item is of interest
22 / 50
Divide-and-conquer as breaking the problem into a small number of
23 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
24 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
25 / 50
Sorting can be in _________
26 / 50
A RAM is an idealized machine with ______________ random-access memory.
27 / 50
What is the total time to heapify?
28 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
29 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
30 / 50
The function f(n)=n(logn+1)/2 is asymptotically equivalent to nlog n. Here Lower Bound means function f(n) grows asymptotically at ____________ as fast as nlog n.
31 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
32 / 50
Counting sort has time complexity:
33 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
34 / 50
Cont sort is suitable to sort the elements in range 1 to k
35 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
36 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
37 / 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.
38 / 50
In which order we can sort?
39 / 50
In simple brute-force algorithm, we give no thought to efficiency.
40 / 50
In ____________ we have to find rank of an element from given input.
41 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
42 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
43 / 50
For the Sieve Technique we take time
44 / 50
Which may be a stable sort?
45 / 50
For the heap sort, access to nodes involves simple _______________ operations.
46 / 50
______________ graphical representation of algorithm.
47 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
48 / 50
In Quick Sort Constants hidden in T(n log n) are
49 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
50 / 50
Your score is
The average score is 40%
Restart quiz
