CS502-Midterm
1 / 50
In plane sweep approach, a vertical line is swept across the 2d-plane and _______structure is used for holding the maximal points lying to the left of the sweep line.
2 / 50
In which order we can sort?
3 / 50
The sieve technique works in ___________ as follows
4 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
5 / 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.
6 / 50
For the heap sort, access to nodes involves simple _______________ operations.
7 / 50
Slow sorting algorithms run in,
8 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
9 / 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.
10 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
11 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
12 / 50
When we call heapify then at each level the comparison performed takes time
13 / 50
The Knapsack problem belongs to the domain of _______________ problems.
14 / 50
_______________ is a graphical representation of an algorithm
15 / 50
In simple brute-force algorithm, we give no thought to efficiency.
16 / 50
One Example of in place but not stable sort is
17 / 50
Sieve Technique can be applied to selection problem?
18 / 50
Which may be stable sort:
19 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
20 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
21 / 50
For the Sieve Technique we take time
22 / 50
In Heap Sort algorithm, if heap property is violated _________
23 / 50
24 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
25 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
26 / 50
Divide-and-conquer as breaking the problem into a small number of
27 / 50
The number of nodes in a complete binary tree of height h is
28 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
29 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
30 / 50
Algorithm is concerned with.......issues.
31 / 50
How much time merge sort takes for an array of numbers?
32 / 50
Quick sort is
33 / 50
For the sieve technique we solve the problem,
34 / 50
In Quick Sort Constants hidden in T(n log n) are
35 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
36 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
37 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
38 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
39 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
40 / 50
Analysis of Selection algorithm ends up with,
41 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
42 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
43 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
44 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
45 / 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.
46 / 50
Which may be a stable sort?
47 / 50
Quick sort is best from the perspective of Locality of reference.
48 / 50
In Sieve Technique we do not know which item is of interest
49 / 50
The running time of quick sort depends heavily on the selection of
50 / 50
For the worst-case running time analysis, the nested loop structure containing one “for” and one “while” loop, might be expressed as a pair of _________nested summations.
Your score is
The average score is 40%
Restart quiz
