CS502 Midterm Online Quiz

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

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

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

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

For the sieve technique we solve the problem,

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

One example of in place but not stable algorithm is

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

The sieve technique works in ___________ as follows

For the heap sort we store the tree nodes in

What is the total time to heapify?

An algorithm is a mathematical entity that is dependent on a specific programming language.

How many elements do we eliminate in each time for the Analysis of Selection algorithm?

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

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

Efficient algorithm requires less computational…….

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

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

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

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

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

Slow sorting algorithms run in,

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

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 ____________

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

Random access machine or RAM is a/an

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.

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.

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

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

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

Which may be stable sort:

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

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

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

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

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

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

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

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

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.

The Knapsack problem belongs to the domain of _______________ problems.

Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.

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

Sorting can be in _________

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.

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