CS502-Midterm
1 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
2 / 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.
3 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
4 / 50
Random access machine or RAM is a/an
5 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
6 / 50
The O-notation is used to state only the asymptotic ________bounds.
7 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
8 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
9 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
10 / 50
The running time of quick sort depends heavily on the selection of
11 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
12 / 50
The Knapsack problem belongs to the domain of _______________ problems.
13 / 50
Counting sort has time complexity:
14 / 50
For the heap sort, access to nodes involves simple _______________ operations.
15 / 50
Cont sort is suitable to sort the elements in range 1 to k
16 / 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.
17 / 50
Slow sorting algorithms run in,
18 / 50
In Quick Sort Constants hidden in T(n log n) are
19 / 50
The sieve technique works in ___________ as follows
20 / 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.
21 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
22 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
23 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
24 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
25 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
26 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
27 / 50
______________ graphical representation of algorithm.
28 / 50
How much time merge sort takes for an array of numbers?
29 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
30 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
31 / 50
Which may be a stable sort?
32 / 50
The number of nodes in a complete binary tree of height h is
33 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
34 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
35 / 50
Algorithm is concerned with.......issues.
36 / 50
Quick sort is best from the perspective of Locality of reference.
37 / 50
The sieve technique is a special case, where the number of sub problems is just
38 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
39 / 50
After sorting in merge sort algorithm, merging process is invoked.
40 / 50
When we call heapify then at each level the comparison performed takes time
41 / 50
In which order we can sort?
42 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
43 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
44 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
45 / 50
What is the total time to heapify?
46 / 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.
47 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
48 / 50
In Sieve Technique we do not know which item is of interest
49 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
50 / 50
For the sieve technique we solve the problem,
Your score is
The average score is 40%
Restart quiz
