CS502 Midterm Online Quiz

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

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

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 ____________ we have to find rank of an element from given input.

Analysis of Selection algorithm ends up with,

In which order we can sort?

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

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

The Knapsack problem belongs to the domain of _______________ problems.

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

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

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

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

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.

Efficient algorithm requires less computational…….

Quick sort is

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.

_______________ is a graphical representation of an algorithm

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

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

Counting sort has time complexity:

Which may be stable sort:

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

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.

Which sorting algorithm is faster

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

Slow sorting algorithms run in,

Which may be a stable sort?

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

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

For the sieve technique we solve the problem,

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

The time assumed for each basic operation to execute on RAM model of computation is-----

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

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

Floor and ceiling are ____________ to calculate while analyzing algorithms.

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

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

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

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

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

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

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

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

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

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

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

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

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

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