CS502 Midterm Online Quiz

How many elements do we eliminate in each time for the Analysis of Selection algorithm?

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

In Quick sort, we don’t have the control over the sizes of recursive calls

In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,

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.

What is the total time to heapify?

_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.

For the Sieve Technique we take time

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

Is it possible to sort without making comparisons?

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

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

When we call heapify then at each level the comparison performed takes time

In pseudo code, the level of details depends on intended audience of the algorithm.w

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

Quick sort is

Random access machine or RAM is a/an

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

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

Analysis of Selection algorithm ends up with,

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

F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.

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

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

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.

In simple brute-force algorithm, we give no thought to efficiency.

The sieve technique works in ___________ as follows

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

For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.

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 number of nodes in a complete binary tree of height h is

What is the solution to the recurrence T(n) = T(n/2)+n .

Which may be a stable sort?

The analysis of Selection algorithm shows the total running time is indeed ________in n,

Floor and ceiling are ____________ to calculate while analyzing algorithms.

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

For the sieve technique we solve the problem,

Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________

The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.

One Example of in place but not stable sort is

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

Brute-force algorithm uses no intelligence in pruning out decisions.

Which sorting algorithm is faster

In Heap Sort algorithm, the maximum levels an element can move upward is _________

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

The O-notation is used to state only the asymptotic ________bounds.

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

What type of instructions Random Access Machine (RAM) can execute? Choose best answer

In RAM model instructions are executed

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.