CS502 Midterm Online Quiz

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

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

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

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

from a larger set of _____________

Which may be a stable sort?

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

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

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

What is the total time to heapify?

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

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

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

For the sieve technique we solve the problem,

The Knapsack problem belongs to the domain of _______________ problems.

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

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

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

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

In RAM model instructions are executed

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.

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 pseudo code, the level of details depends on intended audience of the algorithm.w

Sorting can be in _________

Efficient algorithm requires less computational…….

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 analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.

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

For the Sieve Technique we take time

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

One Example of in place but not stable sort is

______________ graphical representation of algorithm.

_______________ is a graphical representation of an algorithm

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

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

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

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

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

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

Which sorting algorithm is faster

One example of in place but not stable algorithm is

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

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

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

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

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

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

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

Counting sort has time complexity:

For the heap sort we store the tree nodes in

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