CS502 Midterm Online Quiz

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

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

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

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

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

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

Divide-and-conquer as breaking the problem into a small number of

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

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

In Heap Sort algorithm, if heap property is violated _________

In which order we can sort?

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

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

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

from a larger set of _____________

Which may be stable sort:

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

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

Slow sorting algorithms run in,

______________ graphical representation of algorithm.

Sieve Technique can be applied to selection problem?

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

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

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

Efficient algorithm requires less computational…….

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

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

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

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

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

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

In RAM model instructions are executed

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

The sieve technique works in ___________ as follows

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

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

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

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

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

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

_______________ is a graphical representation of an algorithm

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

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

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,

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

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

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

Floor and ceiling are ____________ to calculate while analyzing algorithms.

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.

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

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