CS502-Midterm
1 / 50
In Quick Sort Constants hidden in T(n log n) are
2 / 50
In Heap Sort algorithm, if heap property is violated _________
3 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
4 / 50
5 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
6 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
7 / 50
The sieve technique works in ___________ as follows
8 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
9 / 50
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.
10 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
11 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
12 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
13 / 50
How much time merge sort takes for an array of numbers?
14 / 50
Consider the following code:
For(j=1; j
For(k=1; k<15;k++)
For(l=5; l
{
Do_something_constant();
}
What is the order of execution for this code.
15 / 50
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.
16 / 50
In ____________ we have to find rank of an element from given input.
17 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
18 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
19 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
20 / 50
Slow sorting algorithms run in,
21 / 50
One Example of in place but not stable sort is
22 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
23 / 50
One example of in place but not stable algorithm is
24 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
25 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
26 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
27 / 50
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.
28 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
29 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
30 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
31 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
32 / 50
Algorithm is concerned with.......issues.
33 / 50
Efficient algorithm requires less computational…….
34 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
35 / 50
For the heap sort we store the tree nodes in
36 / 50
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.
37 / 50
The Knapsack problem belongs to the domain of _______________ problems.
38 / 50
In Sieve Technique we do not know which item is of interest
39 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
40 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
41 / 50
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.
42 / 50
Which may be a stable sort?
43 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
44 / 50
Due to left complete nature of binary tree, the heap can be stored in
45 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
46 / 50
In RAM model instructions are executed
47 / 50
Quick sort is best from the perspective of Locality of reference.
48 / 50
In which order we can sort?
49 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
50 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
Your score is
The average score is 40%
Restart quiz
