CS502 Midterm Online Quiz

In Heap Sort algorithm, the total running time for Heapify procedure is ____________

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

Slow sorting algorithms run in,

In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.

Quick sort is

One example of in place but not stable algorithm is

Efficient algorithm requires less computational…….

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

For the heap sort we store the tree nodes in

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

The definition of Theta-notation relies on proving ___________asymptotic bound.

Algorithm is a mathematical entity, which is independent of a specific machine and operating system.

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

In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.

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

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

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

Which sorting algorithm is faster

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

For the sieve technique we solve the problem,

Which may be stable sort:

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

The array to be sorted is not passed as argument to the merge sort algorithm.

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

In RAM model instructions are executed

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

What is the total time to heapify?

______________ graphical representation of algorithm.

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

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

Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.

Counting sort has time complexity:

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

For the Sieve Technique we take time

In which order we can sort?

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

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.

Sieve Technique can be applied to selection problem?

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

One Example of in place but not stable sort is

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

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

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

Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.

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

Due to left complete nature of binary tree, the heap can be stored in

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

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

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

Sieve Technique applies to problems where we are interested in finding a single item

from a larger set of _____________