CS502 Midterm Online Quiz

Counting sort has time complexity:

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

from a larger set of _____________

For the Sieve Technique we take time

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

In Heap Sort algorithm, if heap property is violated _________

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

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

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

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

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

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

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

_______________ is a graphical representation of an algorithm

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

For the sieve technique we solve the problem,

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

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

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

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

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

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

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

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

The Knapsack problem belongs to the domain of _______________ problems.

Efficient algorithm requires less computational…….

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

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

Quick sort is

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

In which order we can sort?

For the Sieve Technique we take time

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

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

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

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

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.

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

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

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

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

Analysis of Selection algorithm ends up with,

______________ graphical representation of algorithm.

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

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

Random access machine or RAM is a/an

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

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

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

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

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