CS502-Midterm
1 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
2 / 50
Divide-and-conquer as breaking the problem into a small number of
3 / 50
Quick sort is best from the perspective of Locality of reference.
4 / 50
In ____________ we have to find rank of an element from given input.
5 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
6 / 50
In Sieve Technique we do not know which item is of interest
7 / 50
Cont sort is suitable to sort the elements in range 1 to k
8 / 50
______________ graphical representation of algorithm.
9 / 50
The number of nodes in a complete binary tree of height h is
10 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
11 / 50
Slow sorting algorithms run in,
12 / 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
13 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
14 / 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.
15 / 50
For the heap sort we store the tree nodes in
16 / 50
Counting sort has time complexity:
17 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
18 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
19 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
20 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
21 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
22 / 50
A RAM is an idealized machine with ______________ random-access memory.
23 / 50
Sieve Technique can be applied to selection problem?
24 / 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.
25 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
26 / 50
In RAM model instructions are executed
27 / 50
After sorting in merge sort algorithm, merging process is invoked.
28 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
29 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
30 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
31 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
32 / 50
The running time of quick sort depends heavily on the selection of
33 / 50
Due to left complete nature of binary tree, the heap can be stored in
34 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
35 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
36 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
37 / 50
38 / 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.
39 / 50
The O-notation is used to state only the asymptotic ________bounds.
40 / 50
Analysis of Selection algorithm ends up with,
41 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
42 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
43 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
44 / 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.
45 / 50
Is it possible to sort without making comparisons?
46 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
47 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
48 / 50
_______________ is a graphical representation of an algorithm
49 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
50 / 50
In the analysis of Selection algorithm, we eliminate a constant fraction of the array with each phase; we get the convergent _______________ series in the analysis,
Your score is
The average score is 40%
Restart quiz
