CS502 Midterm Online Quiz

Sieve Technique can be applied to selection problem?

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

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

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

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

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

Which may be stable sort:

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

The sieve technique is a special case, where the number of sub problems is just

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

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

Algorithm analysts know for sure about efficient solutions for NP-complete problems.

Random access machine or RAM is a/an

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

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.

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

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

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

Floor and ceiling are ____________ to calculate while analyzing algorithms.

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

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

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,

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

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

What is the total time to heapify?

Which may be a stable sort?

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

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

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

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

The sieve technique works in ___________ as follows

Quick sort is

Counting sort has time complexity:

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

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

For the Sieve Technique we take time

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

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

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

Analysis of Selection algorithm ends up with,

______________ graphical representation of algorithm.

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

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

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

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 Sieve Technique we do not know which item is of interest

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

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

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

Algorithm is concerned with.......issues.