CS502-Midterm
1 / 50
What is the total time to heapify?
2 / 50
The number of nodes in a complete binary tree of height h is
3 / 50
For the heap sort, access to nodes involves simple _______________ operations.
4 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
5 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
6 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
7 / 50
What type of instructions Random Access Machine (RAM) can execute?
8 / 50
When we call heapify then at each level the comparison performed takes time
9 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
10 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
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
Analysis of Selection algorithm ends up with,
13 / 50
How much time merge sort takes for an array of numbers?
14 / 50
Which may be a stable sort?
15 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
16 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
17 / 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.
18 / 50
For the Sieve Technique we take time
19 / 50
In Sieve Technique we do not know which item is of interest
20 / 50
One example of in place but not stable algorithm is
21 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
22 / 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,
23 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
24 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
25 / 50
Slow sorting algorithms run in,
26 / 50
In Quick Sort Constants hidden in T(n log n) are
27 / 50
After sorting in merge sort algorithm, merging process is invoked.
28 / 50
29 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
30 / 50
One Example of in place but not stable sort is
31 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
32 / 50
The O-notation is used to state only the asymptotic ________bounds.
33 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
34 / 50
The sieve technique works in ___________ as follows
35 / 50
In ____________ we have to find rank of an element from given input.
36 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
37 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
38 / 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.
39 / 50
40 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
41 / 50
Which may be stable sort:
42 / 50
The sieve technique is a special case, where the number of sub problems is just
43 / 50
In RAM model instructions are executed
44 / 50
For the sieve technique we solve the problem,
45 / 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.
46 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
47 / 50
Quick sort is best from the perspective of Locality of reference.
48 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
49 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
50 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
Your score is
The average score is 40%
Restart quiz
