CS502-Midterm
1 / 50
How much time merge sort takes for an array of numbers?
2 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
3 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
4 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
5 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
6 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
7 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
8 / 50
The number of nodes in a complete binary tree of height h is
9 / 50
In Sieve Technique we do not know which item is of interest
10 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
11 / 50
After sorting in merge sort algorithm, merging process is invoked.
12 / 50
When we call heapify then at each level the comparison performed takes time
13 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
14 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
15 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
16 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
17 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
18 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
19 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
20 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
21 / 50
Which sorting algorithm is faster
22 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
23 / 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.
24 / 50
One Example of in place but not stable sort is
25 / 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.
26 / 50
What is the total time to heapify?
27 / 50
Random access machine or RAM is a/an
28 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
29 / 50
A heap is a left-complete binary tree that conforms to the ___________
30 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
31 / 50
Which may be a stable sort?
32 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
33 / 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.
34 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
35 / 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.
36 / 50
Counting sort has time complexity:
37 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
38 / 50
Efficient algorithm requires less computational…….
39 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
40 / 50
In ____________ we have to find rank of an element from given input.
41 / 50
Due to left complete nature of binary tree, the heap can be stored in
42 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
43 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
44 / 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
45 / 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,
46 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
47 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
48 / 50
Cont sort is suitable to sort the elements in range 1 to k
49 / 50
If we associate (x, y) integers pair to cars where x is the speed of the car and y is the negation of the price. High y value for a car means a ________ car.
50 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
Your score is
The average score is 40%
Restart quiz
