CS502-Midterm
1 / 50
Quick sort is best from the perspective of Locality of reference.
2 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
3 / 50
In Sieve Technique we do not know which item is of interest
4 / 50
The number of nodes in a complete binary tree of height h is
5 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
6 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
7 / 50
Analysis of Selection algorithm ends up with,
8 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
9 / 50
In Quick Sort Constants hidden in T(n log n) are
10 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
11 / 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.
12 / 50
Quick sort is
13 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
14 / 50
15 / 50
The sieve technique is a special case, where the number of sub problems is just
16 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
17 / 50
In which order we can sort?
18 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
19 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
20 / 50
How much time merge sort takes for an array of numbers?
21 / 50
22 / 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.
23 / 50
Sorting can be in _________
24 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
25 / 50
For the Sieve Technique we take time
26 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
27 / 50
Which sorting algorithm is faster
28 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
29 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
30 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
31 / 50
In simple brute-force algorithm, we give no thought to efficiency.
32 / 50
Due to left complete nature of binary tree, the heap can be stored in
33 / 50
Which may be stable sort:
34 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
35 / 50
A heap is a left-complete binary tree that conforms to the ___________
36 / 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
37 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
38 / 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.
39 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
40 / 50
Sieve Technique can be applied to selection problem?
41 / 50
Divide-and-conquer as breaking the problem into a small number of
42 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
43 / 50
A RAM is an idealized machine with ______________ random-access memory.
44 / 50
Counting sort has time complexity:
45 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
46 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
47 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
48 / 50
For the heap sort, access to nodes involves simple _______________ operations.
49 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
50 / 50
Cont sort is suitable to sort the elements in range 1 to k
Your score is
The average score is 40%
Restart quiz
