CS502-Midterm
1 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
2 / 50
A RAM is an idealized machine with ______________ random-access memory.
3 / 50
A heap is a left-complete binary tree that conforms to the ___________
4 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
5 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
6 / 50
What is the total time to heapify?
7 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
8 / 50
In simple brute-force algorithm, we give no thought to efficiency.
9 / 50
The sieve technique is a special case, where the number of sub problems is just
10 / 50
Is it possible to sort without making comparisons?
11 / 50
The sieve technique works in ___________ as follows
12 / 50
Which may be a stable sort?
13 / 50
In Heap Sort algorithm, if heap property is violated _________
14 / 50
Which sorting algorithm is faster
15 / 50
How much time merge sort takes for an array of numbers?
16 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
17 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
18 / 50
One example of in place but not stable algorithm is
19 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
20 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
21 / 50
In ____________ we have to find rank of an element from given input.
22 / 50
In RAM model instructions are executed
23 / 50
______________ graphical representation of algorithm.
24 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
25 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
26 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
27 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
28 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
29 / 50
Sorting can be in _________
30 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
31 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
32 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
33 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
34 / 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.
35 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
36 / 50
In Sieve Technique we do not know which item is of interest
37 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
38 / 50
For the sieve technique we solve the problem,
39 / 50
Divide-and-conquer as breaking the problem into a small number of
40 / 50
Quick sort is best from the perspective of Locality of reference.
41 / 50
In Quick Sort Constants hidden in T(n log n) are
42 / 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.
43 / 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,
44 / 50
When we call heapify then at each level the comparison performed takes time
45 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
46 / 50
Sieve Technique can be applied to selection problem?
47 / 50
In which order we can sort?
48 / 50
49 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
50 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
Your score is
The average score is 40%
Restart quiz
