CS502 Midterm Online Quiz

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

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

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

For the heap sort we store the tree nodes in

______________ graphical representation of algorithm.

A RAM is an idealized algorithm with takes an infinitely large random-access memory.

For the Sieve Technique we take time

Which may be a stable sort?

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

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

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

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

Floor and ceiling are ____________ to calculate while analyzing algorithms.

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

Sieve Technique can be applied to selection problem?

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

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

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

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

In RAM model instructions are executed

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 Heap Sort algorithm, we build _______ for ascending sort.

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 Heap Sort algorithm, the maximum levels an element can move upward is _________

A RAM is an idealized machine with ______________ random-access memory.

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

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

In which order we can sort?

Which sorting algorithm is faster

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

What is the total time to heapify?

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

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

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,

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

Analysis of Selection algorithm ends up with,

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

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

from a larger set of _____________

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

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

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

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

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

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

In Heap Sort algorithm, if heap property is violated _________

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

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

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

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

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