CS502-Midterm
1 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
2 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
3 / 50
Due to left complete nature of binary tree, the heap can be stored in
4 / 50
One example of in place but not stable algorithm is
5 / 50
Random access machine or RAM is a/an
6 / 50
In ____________ we have to find rank of an element from given input.
7 / 50
In Heap Sort algorithm, if heap property is violated _________
8 / 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
9 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
10 / 50
In Sieve Technique we do not know which item is of interest
11 / 50
______________ graphical representation of algorithm.
12 / 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.
13 / 50
In which order we can sort?
14 / 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.
15 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
16 / 50
17 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
18 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
19 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
20 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
21 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
22 / 50
In Quick Sort Constants hidden in T(n log n) are
23 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
24 / 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,
25 / 50
When we call heapify then at each level the comparison performed takes time
26 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
27 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
28 / 50
_______________ is a graphical representation of an algorithm
29 / 50
Which may be a stable sort?
30 / 50
Sorting can be in _________
31 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
32 / 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.
33 / 50
The sieve technique is a special case, where the number of sub problems is just
34 / 50
For the Sieve Technique we take time
35 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
36 / 50
Analysis of Selection algorithm ends up with,
37 / 50
The sieve technique works in ___________ as follows
38 / 50
39 / 50
40 / 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.
41 / 50
If we associate (x, y) integers pair to cars where x is the speed of the car and y is the negation of the price. High y value for a car means a ________ car.
42 / 50
Quick sort is
43 / 50
After sorting in merge sort algorithm, merging process is invoked.
44 / 50
For the heap sort we store the tree nodes in
45 / 50
46 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
47 / 50
For the sieve technique we solve the problem,
48 / 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.
49 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
50 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
Your score is
The average score is 40%
Restart quiz
