CS502-Midterm
1 / 50
For the heap sort we store the tree nodes in
2 / 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.
3 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
4 / 50
Quick sort is best from the perspective of Locality of reference.
5 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
6 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
7 / 50
For the Sieve Technique we take time
8 / 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.
9 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
10 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
11 / 50
Cont sort is suitable to sort the elements in range 1 to k
12 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
13 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
14 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
15 / 50
Analysis of Selection algorithm ends up with,
16 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
17 / 50
For the heap sort, access to nodes involves simple _______________ operations.
18 / 50
Which may be a stable sort?
19 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
20 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
21 / 50
One example of in place but not stable algorithm is
22 / 50
_______________ is a graphical representation of an algorithm
23 / 50
Efficient algorithm requires less computational…….
24 / 50
In Quick Sort Constants hidden in T(n log n) are
25 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
26 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
27 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
28 / 50
Due to left complete nature of binary tree, the heap can be stored in
29 / 50
______________ graphical representation of algorithm.
30 / 50
How much time merge sort takes for an array of numbers?
31 / 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.
32 / 50
Counting sort has time complexity:
33 / 50
In ____________ we have to find rank of an element from given input.
34 / 50
The Knapsack problem belongs to the domain of _______________ problems.
35 / 50
36 / 50
In Sieve Technique we do not know which item is of interest
37 / 50
In RAM model instructions are executed
38 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
39 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
40 / 50
When we call heapify then at each level the comparison performed takes time
41 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
42 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
43 / 50
In which order we can sort?
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
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.
46 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
47 / 50
48 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
49 / 50
What is the total time to heapify?
50 / 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.
Your score is
The average score is 40%
Restart quiz
