CS502-Midterm
1 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
2 / 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
3 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
4 / 50
Quick sort is
5 / 50
The sieve technique is a special case, where the number of sub problems is just
6 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
7 / 50
In simple brute-force algorithm, we give no thought to efficiency.
8 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
9 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
10 / 50
One example of in place but not stable algorithm is
11 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
12 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
13 / 50
A RAM is an idealized machine with ______________ random-access memory.
14 / 50
______________ graphical representation of algorithm.
15 / 50
Which may be stable sort:
16 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
17 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
18 / 50
Algorithm is concerned with.......issues.
19 / 50
The number of nodes in a complete binary tree of height h is
20 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
21 / 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.
22 / 50
In Sieve Technique we do not know which item is of interest
23 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
24 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
25 / 50
In Quick Sort Constants hidden in T(n log n) are
26 / 50
27 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
28 / 50
What is the total time to heapify?
29 / 50
In which order we can sort?
30 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
31 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
32 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
33 / 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.
34 / 50
Which sorting algorithm is faster
35 / 50
Analysis of Selection algorithm ends up with,
36 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
37 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
38 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
39 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
40 / 50
Divide-and-conquer as breaking the problem into a small number of
41 / 50
Counting sort has time complexity:
42 / 50
Is it possible to sort without making comparisons?
43 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
44 / 50
Sieve Technique can be applied to selection problem?
45 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
46 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
47 / 50
The running time of quick sort depends heavily on the selection of
48 / 50
49 / 50
50 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
Your score is
The average score is 40%
Restart quiz
