CS502 Midterm Online Quiz

_______________ is a graphical representation of an algorithm

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

One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.

An in place sorting algorithm is one that uses ___ arrays for storage

Random access machine or RAM is a/an

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

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

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

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

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

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

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

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

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

The sieve technique works in ___________ as follows

In Heap Sort algorithm, if heap property is violated _________

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

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

Quick sort is

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

For the Sieve Technique we take time

How much time merge sort takes for an array of numbers?

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.

In which order we can sort?

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

Sorting can be in _________

In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.

While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.

The number of nodes in a complete binary tree of height h is

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

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

______________ graphical representation of algorithm.

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

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

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

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

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

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

In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.

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

Which may be stable sort:

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

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

Slow sorting algorithms run in,

What is the total time to heapify?

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,

If we associate (x, y) integers pair to cars where x is the speed of the car and y is the negation of the price. High y value for a car means a ________ car.

Efficient algorithm requires less computational…….

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

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