CS502-Midterm
1 / 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.
2 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
3 / 50
______________ graphical representation of algorithm.
4 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
5 / 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.
6 / 50
What is the total time to heapify?
7 / 50
Slow sorting algorithms run in,
8 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
9 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
10 / 50
The running time of quick sort depends heavily on the selection of
11 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
12 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
13 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
14 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
15 / 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.
16 / 50
The O-notation is used to state only the asymptotic ________bounds.
17 / 50
Which may be stable sort:
18 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
19 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
20 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
21 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
22 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
23 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
24 / 50
Which may be a stable sort?
25 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
26 / 50
The sieve technique works in ___________ as follows
27 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
28 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
29 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
30 / 50
For the Sieve Technique we take time
31 / 50
In Sieve Technique we do not know which item is of interest
32 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
33 / 50
One example of in place but not stable algorithm is
34 / 50
Sieve Technique can be applied to selection problem?
35 / 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
36 / 50
Quick sort is
37 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
38 / 50
One Example of in place but not stable sort is
39 / 50
Random access machine or RAM is a/an
40 / 50
Which sorting algorithm is faster
41 / 50
In Heap Sort algorithm, if heap property is violated _________
42 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
43 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
44 / 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.
45 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
46 / 50
The number of nodes in a complete binary tree of height h is
47 / 50
In Quick Sort Constants hidden in T(n log n) are
48 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
49 / 50
Sorting can be in _________
50 / 50
When we call heapify then at each level the comparison performed takes time
Your score is
The average score is 40%
Restart quiz
