CS502 Midterm Online Quiz

A point p in 2-dimensional space is usually given by its integer coordinate(s)____________

For the sieve technique we solve the problem,

Analysis of Selection algorithm ends up with,

What is the total time to heapify?

Sorting can be in _________

The running time of quick sort depends heavily on the selection of

For Chain Matrix Multiplication we can not use divide and conquer approach because,

For the Sieve Technique we take time

The Knapsack problem belongs to the domain of _______________ problems.

Divide-and-conquer as breaking the problem into a small number of

In Heap Sort algorithm, we build _______ for ascending sort.

In Heap Sort algorithm, if heap property is violated _________

For Chain Matrix Multiplication we can not use divide and conquer approach because,

In ____________ we have to find rank of an element from given input.

A (an) _________ is a left-complete binary tree that conforms to the heap order

Quick sort is best from the perspective of Locality of reference.

In which order we can sort?

Asymptotic growth rate of the function is taken over_________ case running time.

One Example of in place but not stable sort is

The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,

Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,

In Sieve Technique we do not know which item is of interest

In Quick Sort Constants hidden in T(n log n) are

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

While solving Selection problem, in Sieve technique we partition input data __________w

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.

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.

Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,

We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.

Cont sort is suitable to sort the elements in range 1 to k

Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:

For the heap sort, access to nodes involves simple _______________ operations.

In Quick Sort Constants hidden in T(n log n) are

For the worst-case running time analysis, the nested loop structure containing one “for” and one “while” loop, might be expressed as a pair of _________nested summations.

In 2d-space a point is said to be ________if it is not dominated by any other point in that space.

Counting sort has time complexity:

In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the

The sieve technique works where we have to find _________ item(s) from a large input.

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.

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,

In Heap Sort algorithm, we build _______ for ascending sort.

An algorithm is a mathematical entity that is dependent on a specific programming language.

After sorting in merge sort algorithm, merging process is invoked.

Consider the following code:

For(j=1; j