CS502-Midterm
1 / 50
What is the total time to heapify?
2 / 50
Algorithm is concerned with.......issues.
3 / 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.
4 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
5 / 50
Sorting can be in _________
6 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
7 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
8 / 50
The number of nodes in a complete binary tree of height h is
9 / 50
Which may be stable sort:
10 / 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
11 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
12 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
13 / 50
For the Sieve Technique we take time
14 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
15 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
16 / 50
The running time of quick sort depends heavily on the selection of
17 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
18 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
19 / 50
Which sorting algorithm is faster
20 / 50
Due to left complete nature of binary tree, the heap can be stored in
21 / 50
In Sieve Technique we do not know which item is of interest
22 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
23 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
24 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
25 / 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.
26 / 50
Which may be a stable sort?
27 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
28 / 50
One example of in place but not stable algorithm is
29 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
30 / 50
A heap is a left-complete binary tree that conforms to the ___________
31 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
32 / 50
Random access machine or RAM is a/an
33 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
34 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
35 / 50
The sieve technique is a special case, where the number of sub problems is just
36 / 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.
37 / 50
When we call heapify then at each level the comparison performed takes time
38 / 50
For the sieve technique we solve the problem,
39 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
40 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
41 / 50
A RAM is an idealized machine with ______________ random-access memory.
42 / 50
In simple brute-force algorithm, we give no thought to efficiency.
43 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
44 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
45 / 50
In Quick Sort Constants hidden in T(n log n) are
46 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
47 / 50
______________ graphical representation of algorithm.
48 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
49 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
50 / 50
Quick sort is best from the perspective of Locality of reference.
Your score is
The average score is 40%
Restart quiz
