CS502-Midterm
1 / 50
Efficient algorithm requires less computational…….
2 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
3 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
4 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
5 / 50
Which sorting algorithm is faster
6 / 50
_______________ is a graphical representation of an algorithm
7 / 50
In Sieve Technique we do not know which item is of interest
8 / 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,
9 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
10 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
11 / 50
Quick sort is best from the perspective of Locality of reference.
12 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
13 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
14 / 50
The running time of quick sort depends heavily on the selection of
15 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
16 / 50
The Knapsack problem belongs to the domain of _______________ problems.
17 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
18 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
19 / 50
What is the total time to heapify?
20 / 50
Analysis of Selection algorithm ends up with,
21 / 50
The O-notation is used to state only the asymptotic ________bounds.
22 / 50
23 / 50
How much time merge sort takes for an array of numbers?
24 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
25 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
26 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
27 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
28 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
29 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
30 / 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.
31 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
32 / 50
Which may be stable sort:
33 / 50
Quick sort is
34 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
35 / 50
For the heap sort we store the tree nodes in
36 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
37 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
38 / 50
One Example of in place but not stable sort is
39 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
40 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
41 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
42 / 50
One example of in place but not stable algorithm is
43 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
44 / 50
______________ graphical representation of algorithm.
45 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
46 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
47 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
48 / 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
49 / 50
A heap is a left-complete binary tree that conforms to the ___________
50 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
Your score is
The average score is 40%
Restart quiz
