CS502-Midterm
1 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
2 / 50
In simple brute-force algorithm, we give no thought to efficiency.
3 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
4 / 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.
5 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
6 / 50
Sorting can be in _________
7 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
8 / 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.
9 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
10 / 50
In Quick Sort Constants hidden in T(n log n) are
11 / 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.
12 / 50
The sieve technique is a special case, where the number of sub problems is just
13 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
14 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
15 / 50
In ____________ we have to find rank of an element from given input.
16 / 50
Quick sort is best from the perspective of Locality of reference.
17 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
18 / 50
Due to left complete nature of binary tree, the heap can be stored in
19 / 50
One example of in place but not stable algorithm is
20 / 50
In Sieve Technique we do not know which item is of interest
21 / 50
In the analysis of Selection algorithm, we eliminate a constant fraction of the array with each phase; we get the convergent _______________ series in the analysis,
22 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
23 / 50
For the sieve technique we solve the problem,
24 / 50
How much time merge sort takes for an array of numbers?
25 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
26 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
27 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
28 / 50
Analysis of Selection algorithm ends up with,
29 / 50
The running time of quick sort depends heavily on the selection of
30 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
31 / 50
Algorithm is concerned with.......issues.
32 / 50
For the heap sort, access to nodes involves simple _______________ operations.
33 / 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.
34 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
35 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
36 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
37 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
38 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
39 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
40 / 50
Cont sort is suitable to sort the elements in range 1 to k
41 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
42 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
43 / 50
Counting sort has time complexity:
44 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
45 / 50
46 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
47 / 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.
48 / 50
Quick sort is
49 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
50 / 50
Slow sorting algorithms run in,
Your score is
The average score is 40%
Restart quiz
