CS502-Midterm
1 / 50
The function f(n)= n(logn+1)/2 is asymptotically equivalent to n log n. Here Upper Bound means the function f(n) grows asymptotically ____________ faster than n log n.
2 / 50
Sorting can be in _________
3 / 50
In Heap Sort algorithm, if heap property is violated _________
4 / 50
The Knapsack problem belongs to the domain of _______________ problems.
5 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
6 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
7 / 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.
8 / 50
Quick sort is
9 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
10 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
11 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
12 / 50
A heap is a left-complete binary tree that conforms to the ___________
13 / 50
In Sieve Technique we do not know which item is of interest
14 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
15 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
16 / 50
Cont sort is suitable to sort the elements in range 1 to k
17 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
18 / 50
Which may be a stable sort?
19 / 50
20 / 50
For the Sieve Technique we take time
21 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
22 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
23 / 50
Algorithm is concerned with.......issues.
24 / 50
Analysis of Selection algorithm ends up with,
25 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
26 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
27 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
28 / 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,
29 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
30 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
31 / 50
In RAM model instructions are executed
32 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
33 / 50
The running time of quick sort depends heavily on the selection of
34 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
35 / 50
How much time merge sort takes for an array of numbers?
36 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
37 / 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
38 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
39 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
40 / 50
One Example of in place but not stable sort is
41 / 50
Which sorting algorithm is faster
42 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
43 / 50
_______________ is a graphical representation of an algorithm
44 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
45 / 50
When we call heapify then at each level the comparison performed takes time
46 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
47 / 50
Which may be stable sort:
48 / 50
One example of in place but not stable algorithm is
49 / 50
50 / 50
Counting sort has time complexity:
Your score is
The average score is 40%
Restart quiz