CS502 Midterm Online Quiz

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

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

Sieve Technique can be applied to selection problem?

The Knapsack problem belongs to the domain of _______________ problems.

Which may be stable sort:

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

Quick sort is

One example of in place but not stable algorithm is

Which may be a stable sort?

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

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

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.

In Heap Sort algorithm, if heap property is violated _________

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.

Efficient algorithm requires less computational…….

An in place sorting algorithm is one that uses ___ arrays for storage

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.

What is the total time to heapify?

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

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

Which sorting algorithm is faster

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

For the heap sort, access to nodes involves simple _______________ operations.

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

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

Analysis of Selection algorithm ends up with,

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

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

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

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

Slow sorting algorithms run in,

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

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

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

For the heap sort we store the tree nodes in

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.

If there are Θ (n2) entries in edit distance matrix then the total running time is

In ____________ we have to find rank of an element from given input.

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

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

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

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

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

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

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

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

What is the total time to heapify?

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.

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