CS502-Midterm
1 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
2 / 50
In Quick Sort Constants hidden in T(n log n) are
3 / 50
Quick sort is best from the perspective of Locality of reference.
4 / 50
One Example of in place but not stable sort is
5 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
6 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
7 / 50
After sorting in merge sort algorithm, merging process is invoked.
8 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
9 / 50
Efficient algorithm requires less computational…….
10 / 50
The Knapsack problem belongs to the domain of _______________ problems.
11 / 50
A heap is a left-complete binary tree that conforms to the ___________
12 / 50
In Sieve Technique we do not know which item is of interest
13 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
14 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
15 / 50
What is the total time to heapify?
16 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
17 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
18 / 50
The function f(n)= n(logn+1)/2 is asymptotically equivalent to n log n. Here Upper Bound means the function f(n) grows asymptotically ____________ faster than n log n.
19 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
20 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
21 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
22 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
23 / 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,
24 / 50
In Heap Sort algorithm, if heap property is violated _________
25 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
26 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
27 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
28 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
29 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
30 / 50
Divide-and-conquer as breaking the problem into a small number of
31 / 50
What type of instructions Random Access Machine (RAM) can execute?
32 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
33 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
34 / 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.
35 / 50
Which may be stable sort:
36 / 50
Is it possible to sort without making comparisons?
37 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
38 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
39 / 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.
40 / 50
In RAM model instructions are executed
41 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
42 / 50
43 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
44 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
45 / 50
46 / 50
The O-notation is used to state only the asymptotic ________bounds.
47 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
48 / 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.
49 / 50
The sieve technique is a special case, where the number of sub problems is just
50 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
Your score is
The average score is 40%
Restart quiz
