CS502 Midterm Online Quiz

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

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

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

One Example of in place but not stable sort is

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

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

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 Quick Sort Constants hidden in T(n log n) are

Which may be stable sort:

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

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

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

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.

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

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

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

Is it possible to sort without making comparisons?

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

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

Efficient algorithm requires less computational…….

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

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

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

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

In pseudo code, the level of details depends on intended audience of the algorithm.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.

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

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

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

One example of in place but not stable algorithm is

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

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

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

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

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

For the sieve technique we solve the problem,

______________ graphical representation of algorithm.

In Heap Sort algorithm, if heap property is violated _________

A heap is a left-complete binary tree that conforms to the ___________

If there are Θ (n2) entries in edit distance matrix then the total running time is

Which may be a stable sort?

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.

Slow sorting algorithms run in,

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

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

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

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

Sieve Technique can be applied to selection problem?

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

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