CS502-Midterm
1 / 50
For the heap sort, access to nodes involves simple _______________ operations.
2 / 50
In ____________ we have to find rank of an element from given input.
3 / 50
______________ graphical representation of algorithm.
4 / 50
Counting sort has time complexity:
5 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
6 / 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.
7 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
8 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
9 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
10 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
11 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
12 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
13 / 50
Quick sort is
14 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
15 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
16 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
17 / 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.
18 / 50
In Sieve Technique we do not know which item is of interest
19 / 50
What is the total time to heapify?
20 / 50
Analysis of Selection algorithm ends up with,
21 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
22 / 50
What type of instructions Random Access Machine (RAM) can execute?
23 / 50
Quick sort is best from the perspective of Locality of reference.
24 / 50
Divide-and-conquer as breaking the problem into a small number of
25 / 50
The sieve technique is a special case, where the number of sub problems is just
26 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
27 / 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.
28 / 50
After sorting in merge sort algorithm, merging process is invoked.
29 / 50
In Quick Sort Constants hidden in T(n log n) are
30 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
31 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
32 / 50
Due to left complete nature of binary tree, the heap can be stored in
33 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
34 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
35 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
36 / 50
In RAM model instructions are executed
37 / 50
Sieve Technique can be applied to selection problem?
38 / 50
Random access machine or RAM is a/an
39 / 50
For the Sieve Technique we take time
40 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
41 / 50
In simple brute-force algorithm, we give no thought to efficiency.
42 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
43 / 50
Which may be stable sort:
44 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
45 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
46 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
47 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
48 / 50
Algorithm is concerned with.......issues.
49 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
50 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
Your score is
The average score is 40%
Restart quiz
