CS502-Midterm
1 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
2 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
3 / 50
Due to left complete nature of binary tree, the heap can be stored in
4 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
5 / 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.
6 / 50
The sieve technique is a special case, where the number of sub problems is just
7 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
8 / 50
In Quick Sort Constants hidden in T(n log n) are
9 / 50
Counting sort has time complexity:
10 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
11 / 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,
12 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
13 / 50
Efficient algorithm requires less computational…….
14 / 50
Which sorting algorithm is faster
15 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
16 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
17 / 50
Which may be a stable sort?
18 / 50
Quick sort is best from the perspective of Locality of reference.
19 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
20 / 50
In RAM model instructions are executed
21 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
22 / 50
For the heap sort, access to nodes involves simple _______________ operations.
23 / 50
In Heap Sort algorithm, if heap property is violated _________
24 / 50
What is the total time to heapify?
25 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
26 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
27 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
28 / 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.
29 / 50
After sorting in merge sort algorithm, merging process is invoked.
30 / 50
Sorting can be in _________
31 / 50
In simple brute-force algorithm, we give no thought to efficiency.
32 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
33 / 50
The running time of quick sort depends heavily on the selection of
34 / 50
35 / 50
One Example of in place but not stable sort is
36 / 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
37 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
38 / 50
In Sieve Technique we do not know which item is of interest
39 / 50
The number of nodes in a complete binary tree of height h is
40 / 50
One example of in place but not stable algorithm is
41 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
42 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
43 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
44 / 50
Random access machine or RAM is a/an
45 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
46 / 50
For the Sieve Technique we take time
47 / 50
48 / 50
Slow sorting algorithms run in,
49 / 50
Analysis of Selection algorithm ends up with,
50 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
Your score is
The average score is 40%
Restart quiz
