CS502-Midterm
1 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
2 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
3 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
4 / 50
A RAM is an idealized machine with ______________ random-access memory.
5 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
6 / 50
What type of instructions Random Access Machine (RAM) can execute?
7 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
8 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
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
What is the solution to the recurrence T(n) = T(n/2)+n .
11 / 50
In simple brute-force algorithm, we give no thought to efficiency.
12 / 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.
13 / 50
The number of nodes in a complete binary tree of height h is
14 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
15 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
16 / 50
In Sieve Technique we do not know which item is of interest
17 / 50
One example of in place but not stable algorithm is
18 / 50
In which order we can sort?
19 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
20 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
21 / 50
Random access machine or RAM is a/an
22 / 50
Quick sort is
23 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
24 / 50
In Heap Sort algorithm, if heap property is violated _________
25 / 50
Efficient algorithm requires less computational…….
26 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
27 / 50
Quick sort is best from the perspective of Locality of reference.
28 / 50
29 / 50
30 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
31 / 50
A heap is a left-complete binary tree that conforms to the ___________
32 / 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,
33 / 50
When we call heapify then at each level the comparison performed takes time
34 / 50
How much time merge sort takes for an array of numbers?
35 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
36 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
37 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
38 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
39 / 50
Slow sorting algorithms run in,
40 / 50
The sieve technique is a special case, where the number of sub problems is just
41 / 50
What is the total time to heapify?
42 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
43 / 50
Counting sort has time complexity:
44 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
45 / 50
Sorting can be in _________
46 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
47 / 50
In Quick Sort Constants hidden in T(n log n) are
48 / 50
The sieve technique works in ___________ as follows
49 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
50 / 50
______________ graphical representation of algorithm.
Your score is
The average score is 40%
Restart quiz
