CS502-Midterm
1 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
2 / 50
For the Sieve Technique we take time
3 / 50
When we call heapify then at each level the comparison performed takes time
4 / 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.
5 / 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,
6 / 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.
7 / 50
For the heap sort, access to nodes involves simple _______________ operations.
8 / 50
In simple brute-force algorithm, we give no thought to efficiency.
9 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
10 / 50
In Quick Sort Constants hidden in T(n log n) are
11 / 50
In RAM model instructions are executed
12 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
13 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
14 / 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.
15 / 50
Algorithm is concerned with.......issues.
16 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
17 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
18 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
19 / 50
Quick sort is
20 / 50
Analysis of Selection algorithm ends up with,
21 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
22 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
23 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
24 / 50
How much time merge sort takes for an array of numbers?
25 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
26 / 50
What is the total time to heapify?
27 / 50
The sieve technique works in ___________ as follows
28 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
29 / 50
Is it possible to sort without making comparisons?
30 / 50
Due to left complete nature of binary tree, the heap can be stored in
31 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
32 / 50
The O-notation is used to state only the asymptotic ________bounds.
33 / 50
Sorting can be in _________
34 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
35 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
36 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
37 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
38 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
39 / 50
Slow sorting algorithms run in,
40 / 50
In Sieve Technique we do not know which item is of interest
41 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
42 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
43 / 50
44 / 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.
45 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
46 / 50
In ____________ we have to find rank of an element from given input.
47 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
48 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
49 / 50
A heap is a left-complete binary tree that conforms to the ___________
50 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
Your score is
The average score is 40%
Restart quiz
