CS502-Midterm
1 / 50
In Quick Sort Constants hidden in T(n log n) are
2 / 50
Which may be a stable sort?
3 / 50
Algorithm is concerned with.......issues.
4 / 50
The running time of quick sort depends heavily on the selection of
5 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
6 / 50
Counting sort has time complexity:
7 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
8 / 50
A RAM is an idealized machine with ______________ random-access memory.
9 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
10 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
11 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
12 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
13 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
14 / 50
The O-notation is used to state only the asymptotic ________bounds.
15 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
16 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
17 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
18 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
19 / 50
Quick sort is best from the perspective of Locality of reference.
20 / 50
One example of in place but not stable algorithm is
21 / 50
Which may be stable sort:
22 / 50
In Heap Sort algorithm, if heap property is violated _________
23 / 50
One Example of in place but not stable sort is
24 / 50
Efficient algorithm requires less computational…….
25 / 50
For the Sieve Technique we take time
26 / 50
In RAM model instructions are executed
27 / 50
Due to left complete nature of binary tree, the heap can be stored in
28 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
29 / 50
In Sieve Technique we do not know which item is of interest
30 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
31 / 50
32 / 50
______________ graphical representation of algorithm.
33 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
34 / 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.
35 / 50
When we call heapify then at each level the comparison performed takes time
36 / 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,
37 / 50
Sorting can be in _________
38 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
39 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
40 / 50
41 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
42 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
43 / 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
44 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
45 / 50
46 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
47 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
48 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
49 / 50
A heap is a left-complete binary tree that conforms to the ___________
50 / 50
_______________ is a graphical representation of an algorithm
Your score is
The average score is 40%
Restart quiz
