CS502-Midterm
1 / 50
For the Sieve Technique we take time
2 / 50
In Sieve Technique we do not know which item is of interest
3 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
4 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
5 / 50
Algorithm is concerned with.......issues.
6 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
7 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
8 / 50
9 / 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.
10 / 50
One example of in place but not stable algorithm is
11 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
12 / 50
Random access machine or RAM is a/an
13 / 50
Counting sort has time complexity:
14 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
15 / 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
16 / 50
One Example of in place but not stable sort is
17 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
18 / 50
Sieve Technique can be applied to selection problem?
19 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
20 / 50
The running time of quick sort depends heavily on the selection of
21 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
22 / 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.
23 / 50
Cont sort is suitable to sort the elements in range 1 to k
24 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
25 / 50
______________ graphical representation of algorithm.
26 / 50
What is the total time to heapify?
27 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
28 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
29 / 50
30 / 50
The Knapsack problem belongs to the domain of _______________ problems.
31 / 50
Sorting can be in _________
32 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
33 / 50
In Quick Sort Constants hidden in T(n log n) are
34 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
35 / 50
The sieve technique is a special case, where the number of sub problems is just
36 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
37 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
38 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
39 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
40 / 50
In ____________ we have to find rank of an element from given input.
41 / 50
After sorting in merge sort algorithm, merging process is invoked.
42 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
43 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
44 / 50
In simple brute-force algorithm, we give no thought to efficiency.
45 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
46 / 50
The O-notation is used to state only the asymptotic ________bounds.
47 / 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.
48 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
49 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
50 / 50
How much time merge sort takes for an array of numbers?
Your score is
The average score is 40%
Restart quiz
