CS502-Midterm
1 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
2 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
3 / 50
Sorting can be in _________
4 / 50
In Quick Sort Constants hidden in T(n log n) are
5 / 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,
6 / 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.
7 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
8 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
9 / 50
In Sieve Technique we do not know which item is of interest
10 / 50
_______________ is a graphical representation of an algorithm
11 / 50
Cont sort is suitable to sort the elements in range 1 to k
12 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
13 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
14 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
15 / 50
Quick sort is best from the perspective of Locality of reference.
16 / 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.
17 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
18 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
19 / 50
For the heap sort, access to nodes involves simple _______________ operations.
20 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
21 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
22 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
23 / 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
24 / 50
Which may be stable sort:
25 / 50
______________ graphical representation of algorithm.
26 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
27 / 50
For the heap sort we store the tree nodes in
28 / 50
Which sorting algorithm is faster
29 / 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.
30 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
31 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
32 / 50
33 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
34 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
35 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
36 / 50
One Example of in place but not stable sort is
37 / 50
Counting sort has time complexity:
38 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
39 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
40 / 50
A heap is a left-complete binary tree that conforms to the ___________
41 / 50
Efficient algorithm requires less computational…….
42 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
43 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
44 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
45 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
46 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
47 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
48 / 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.
49 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
50 / 50
Due to left complete nature of binary tree, the heap can be stored in
Your score is
The average score is 40%
Restart quiz
