CS502-Midterm
1 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
2 / 50
What is the total time to heapify?
3 / 50
The sieve technique is a special case, where the number of sub problems is just
4 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
5 / 50
In Sieve Technique we do not know which item is of interest
6 / 50
Which may be a stable sort?
7 / 50
Random access machine or RAM is a/an
8 / 50
In ____________ we have to find rank of an element from given input.
9 / 50
In Quick Sort Constants hidden in T(n log n) are
10 / 50
In Heap Sort algorithm, if heap property is violated _________
11 / 50
For the heap sort, access to nodes involves simple _______________ operations.
12 / 50
Upper bound requires that there exist positive constants c2 and n0 such that f(n) ____ c2n for all n <= n0(ye question ghalat lag raha hai mujhae
13 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
14 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
15 / 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.
16 / 50
The sieve technique works in ___________ as follows
17 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
18 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
19 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
20 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
21 / 50
Algorithm is concerned with.......issues.
22 / 50
Quick sort is
23 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
24 / 50
Sorting can be in _________
25 / 50
The running time of quick sort depends heavily on the selection of
26 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
27 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
28 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
29 / 50
_______________ is a graphical representation of an algorithm
30 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
31 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
32 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
33 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
34 / 50
Is it possible to sort without making comparisons?
35 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
36 / 50
Efficient algorithm requires less computational…….
37 / 50
The number of nodes in a complete binary tree of height h is
38 / 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.
39 / 50
A RAM is an idealized machine with ______________ random-access memory.
40 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
41 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
42 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
43 / 50
For the Sieve Technique we take time
44 / 50
One example of in place but not stable algorithm is
45 / 50
What type of instructions Random Access Machine (RAM) can execute?
46 / 50
How much time merge sort takes for an array of numbers?
47 / 50
The O-notation is used to state only the asymptotic ________bounds.
48 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
49 / 50
Analysis of Selection algorithm ends up with,
50 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
Your score is
The average score is 40%
Restart quiz
