CS502 Midterm Online Quiz

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.

Sorting can be in _________

In Heap Sort algorithm, if heap property is violated _________

The Knapsack problem belongs to the domain of _______________ problems.

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

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

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.

Quick sort is

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

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

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

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

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

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

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

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

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

Which may be a stable sort?

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

For the Sieve Technique we take time

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

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

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

Analysis of Selection algorithm ends up with,

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

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

Sorting is one of the few problems where provable ________ bonds exits on how fast we can 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,

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

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

In RAM model instructions are executed

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

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

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

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

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

Upper bound requires that there exist positive constants c2 and n0 such that f(n) ____ c2n for all n <= n0(ye question ghalat lag raha hai mujhae

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

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

One Example of in place but not stable sort is

Which sorting algorithm is faster

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

_______________ is a graphical representation of an algorithm

Asymptotic growth rate of the function is taken over_________ case running time.

When we call heapify then at each level the comparison performed takes time

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

Which may be stable sort:

One example of in place but not stable algorithm is

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

Counting sort has time complexity: