CS502-Midterm
1 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
2 / 50
The running time of quick sort depends heavily on the selection of
3 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
4 / 50
Which may be a stable sort?
5 / 50
In Quick Sort Constants hidden in T(n log n) are
6 / 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.
7 / 50
_______________ is a graphical representation of an algorithm
8 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
9 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
10 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
11 / 50
How much time merge sort takes for an array of numbers?
12 / 50
What is the total time to heapify?
13 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
14 / 50
Cont sort is suitable to sort the elements in range 1 to k
15 / 50
In simple brute-force algorithm, we give no thought to efficiency.
16 / 50
Due to left complete nature of binary tree, the heap can be stored in
17 / 50
In ____________ we have to find rank of an element from given input.
18 / 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
19 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
20 / 50
In Heap Sort algorithm, if heap property is violated _________
21 / 50
Counting sort has time complexity:
22 / 50
Quick sort is best from the perspective of Locality of reference.
23 / 50
Sieve Technique can be applied to selection problem?
24 / 50
______________ graphical representation of algorithm.
25 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
26 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
27 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
28 / 50
For the sieve technique we solve the problem,
29 / 50
Efficient algorithm requires less computational…….
30 / 50
For the heap sort we store the tree nodes in
31 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
32 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
33 / 50
Slow sorting algorithms run in,
34 / 50
Sorting can be in _________
35 / 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.
36 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
37 / 50
The function f(n)=n(logn+1)/2 is asymptotically equivalent to nlog n. Here Lower Bound means function f(n) grows asymptotically at ____________ as fast as nlog n.
38 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
39 / 50
40 / 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.
41 / 50
For the heap sort, access to nodes involves simple _______________ operations.
42 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
43 / 50
In Sieve Technique we do not know which item is of interest
44 / 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.
45 / 50
When we call heapify then at each level the comparison performed takes time
46 / 50
Which may be stable sort:
47 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
48 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
49 / 50
In which order we can sort?
50 / 50
The sieve technique is a special case, where the number of sub problems is just
Your score is
The average score is 40%
Restart quiz
