CS502-Midterm
1 / 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.
2 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
3 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
4 / 50
Efficient algorithm requires less computational…….
5 / 50
Slow sorting algorithms run in,
6 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
7 / 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.
8 / 50
What is the total time to heapify?
9 / 50
Sieve Technique can be applied to selection problem?
10 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
11 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
12 / 50
In Quick Sort Constants hidden in T(n log n) are
13 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
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
For the Sieve Technique we take time
16 / 50
In Sieve Technique we do not know which item is of interest
17 / 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
18 / 50
19 / 50
The sieve technique works in ___________ as follows
20 / 50
A RAM is an idealized machine with ______________ random-access memory.
21 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
22 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
23 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
24 / 50
Is it possible to sort without making comparisons?
25 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
26 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
27 / 50
_______________ is a graphical representation of an algorithm
28 / 50
How much time merge sort takes for an array of numbers?
29 / 50
Sorting can be in _________
30 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
31 / 50
Due to left complete nature of binary tree, the heap can be stored in
32 / 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.
33 / 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.
34 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
35 / 50
36 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
37 / 50
38 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
39 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
40 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
41 / 50
Which sorting algorithm is faster
42 / 50
In ____________ we have to find rank of an element from given input.
43 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
44 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
45 / 50
The running time of quick sort depends heavily on the selection of
46 / 50
Quick sort is best from the perspective of Locality of reference.
47 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
48 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
49 / 50
In simple brute-force algorithm, we give no thought to efficiency.
50 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
Your score is
The average score is 40%
Restart quiz
