CS502-Midterm
1 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
2 / 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,
3 / 50
Efficient algorithm requires less computational…….
4 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
5 / 50
The O-notation is used to state only the asymptotic ________bounds.
6 / 50
The Knapsack problem belongs to the domain of _______________ problems.
7 / 50
In simple brute-force algorithm, we give no thought to efficiency.
8 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
9 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
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
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
12 / 50
Due to left complete nature of binary tree, the heap can be stored in
13 / 50
Quick sort is best from the perspective of Locality of reference.
14 / 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.
15 / 50
The sieve technique is a special case, where the number of sub problems is just
16 / 50
Which may be stable sort:
17 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
18 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
19 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
20 / 50
How much time merge sort takes for an array of numbers?
21 / 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.
22 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
23 / 50
In ____________ we have to find rank of an element from given input.
24 / 50
What is the total time to heapify?
25 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
26 / 50
In Sieve Technique we do not know which item is of interest
27 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
28 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
29 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
30 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
31 / 50
After sorting in merge sort algorithm, merging process is invoked.
32 / 50
For the heap sort we store the tree nodes in
33 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
34 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
35 / 50
One example of in place but not stable algorithm is
36 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
37 / 50
A RAM is an idealized machine with ______________ random-access memory.
38 / 50
One Example of in place but not stable sort is
39 / 50
40 / 50
The number of nodes in a complete binary tree of height h is
41 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
42 / 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.
43 / 50
In which order we can sort?
44 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
45 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
46 / 50
Divide-and-conquer as breaking the problem into a small number of
47 / 50
The running time of quick sort depends heavily on the selection of
48 / 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.
49 / 50
50 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
Your score is
The average score is 40%
Restart quiz
