CS502-Midterm
1 / 50
After sorting in merge sort algorithm, merging process is invoked.
2 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
3 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
4 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
5 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
6 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
7 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
8 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
9 / 50
Sorting can be in _________
10 / 50
Algorithm is concerned with.......issues.
11 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
12 / 50
For the heap sort, access to nodes involves simple _______________ operations.
13 / 50
Cont sort is suitable to sort the elements in range 1 to k
14 / 50
For the sieve technique we solve the problem,
15 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
16 / 50
The sieve technique is a special case, where the number of sub problems is just
17 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
18 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
19 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
20 / 50
For the Sieve Technique we take time
21 / 50
The Knapsack problem belongs to the domain of _______________ problems.
22 / 50
The sieve technique works in ___________ as follows
23 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
24 / 50
In ____________ we have to find rank of an element from given input.
25 / 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
26 / 50
Efficient algorithm requires less computational…….
27 / 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.
28 / 50
The running time of quick sort depends heavily on the selection of
29 / 50
One example of in place but not stable algorithm is
30 / 50
Quick sort is best from the perspective of Locality of reference.
31 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
32 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
33 / 50
Slow sorting algorithms run in,
34 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
35 / 50
Analysis of Selection algorithm ends up with,
36 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
37 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
38 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
39 / 50
40 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
41 / 50
In Quick Sort Constants hidden in T(n log n) are
42 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
43 / 50
Which may be stable sort:
44 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
45 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
46 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
47 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
48 / 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,
49 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
50 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
Your score is
The average score is 40%
Restart quiz
