CS502-Midterm
1 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
2 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
3 / 50
In Heap Sort algorithm, if heap property is violated _________
4 / 50
Counting sort has time complexity:
5 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
6 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
7 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
8 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
9 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
10 / 50
One Example of in place but not stable sort is
11 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
12 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
13 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
14 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
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
The running time of quick sort depends heavily on the selection of
17 / 50
For the sieve technique we solve the problem,
18 / 50
Slow sorting algorithms run in,
19 / 50
Algorithm is concerned with.......issues.
20 / 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.
21 / 50
For the Sieve Technique we take time
22 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
23 / 50
Which may be a stable sort?
24 / 50
The sieve technique works in ___________ as follows
25 / 50
Is it possible to sort without making comparisons?
26 / 50
For the heap sort we store the tree nodes in
27 / 50
28 / 50
The Knapsack problem belongs to the domain of _______________ problems.
29 / 50
______________ graphical representation of algorithm.
30 / 50
What is the total time to heapify?
31 / 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.
32 / 50
Cont sort is suitable to sort the elements in range 1 to k
33 / 50
For the heap sort, access to nodes involves simple _______________ operations.
34 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
35 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
36 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
37 / 50
In Sieve Technique we do not know which item is of interest
38 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
39 / 50
40 / 50
One example of in place but not stable algorithm is
41 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
42 / 50
How much time merge sort takes for an array of numbers?
43 / 50
In Quick Sort Constants hidden in T(n log n) are
44 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
45 / 50
_______________ is a graphical representation of an algorithm
46 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
47 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
48 / 50
49 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
50 / 50
In ____________ we have to find rank of an element from given input.
Your score is
The average score is 40%
Restart quiz
