CS502-Midterm
1 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
2 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
3 / 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.
4 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
5 / 50
The O-notation is used to state only the asymptotic ________bounds.
6 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
7 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
8 / 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.
9 / 50
After sorting in merge sort algorithm, merging process is invoked.
10 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
11 / 50
In ____________ we have to find rank of an element from given input.
12 / 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.
13 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
14 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
15 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
16 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
17 / 50
One example of in place but not stable algorithm is
18 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
19 / 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,
20 / 50
_______________ is a graphical representation of an algorithm
21 / 50
What is the total time to heapify?
22 / 50
The sieve technique is a special case, where the number of sub problems is just
23 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
24 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
25 / 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.
26 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
27 / 50
Cont sort is suitable to sort the elements in range 1 to k
28 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
29 / 50
Which sorting algorithm is faster
30 / 50
For the heap sort, access to nodes involves simple _______________ operations.
31 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
32 / 50
A RAM is an idealized machine with ______________ random-access memory.
33 / 50
Which may be stable sort:
34 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
35 / 50
For the Sieve Technique we take time
36 / 50
Slow sorting algorithms run in,
37 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
38 / 50
In Sieve Technique we do not know which item is of interest
39 / 50
Which may be a stable sort?
40 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
41 / 50
In which order we can sort?
42 / 50
Algorithm is concerned with.......issues.
43 / 50
What type of instructions Random Access Machine (RAM) can execute?
44 / 50
Random access machine or RAM is a/an
45 / 50
46 / 50
Sieve Technique can be applied to selection problem?
47 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
48 / 50
Sorting can be in _________
49 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
50 / 50
The number of nodes in a complete binary tree of height h is
Your score is
The average score is 40%
Restart quiz
