CS502-Midterm
1 / 50
Cont sort is suitable to sort the elements in range 1 to k
2 / 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.
3 / 50
In Quick Sort Constants hidden in T(n log n) are
4 / 50
When we call heapify then at each level the comparison performed takes time
5 / 50
Analysis of Selection algorithm ends up with,
6 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
7 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
8 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
9 / 50
The number of nodes in a complete binary tree of height h is
10 / 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.
11 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
12 / 50
For the heap sort, access to nodes involves simple _______________ operations.
13 / 50
In Sieve Technique we do not know which item is of interest
14 / 50
Algorithm is concerned with.......issues.
15 / 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.
16 / 50
What type of instructions Random Access Machine (RAM) can execute?
17 / 50
The sieve technique is a special case, where the number of sub problems is just
18 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
19 / 50
In Heap Sort algorithm, if heap property is violated _________
20 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
21 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
22 / 50
Quick sort is best from the perspective of Locality of reference.
23 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
24 / 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.
25 / 50
26 / 50
______________ graphical representation of algorithm.
27 / 50
Random access machine or RAM is a/an
28 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
29 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
30 / 50
_______________ is a graphical representation of an algorithm
31 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
32 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
33 / 50
Divide-and-conquer as breaking the problem into a small number of
34 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
35 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
36 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
37 / 50
In RAM model instructions are executed
38 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
39 / 50
In ____________ we have to find rank of an element from given input.
40 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
41 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
42 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
43 / 50
44 / 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,
45 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
46 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
47 / 50
Slow sorting algorithms run in,
48 / 50
Efficient algorithm requires less computational…….
49 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
50 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
Your score is
The average score is 40%
Restart quiz
