CS502-Midterm
1 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
2 / 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.
3 / 50
The running time of quick sort depends heavily on the selection of
4 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
5 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
6 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
7 / 50
The sieve technique is a special case, where the number of sub problems is just
8 / 50
In which order we can sort?
9 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
10 / 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.
11 / 50
The Knapsack problem belongs to the domain of _______________ problems.
12 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
13 / 50
Analysis of Selection algorithm ends up with,
14 / 50
Random access machine or RAM is a/an
15 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
16 / 50
The O-notation is used to state only the asymptotic ________bounds.
17 / 50
For the heap sort we store the tree nodes in
18 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
19 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
20 / 50
When we call heapify then at each level the comparison performed takes time
21 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
22 / 50
In Quick Sort Constants hidden in T(n log n) are
23 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
24 / 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.
25 / 50
In Sieve Technique we do not know which item is of interest
26 / 50
In ____________ we have to find rank of an element from given input.
27 / 50
28 / 50
Counting sort has time complexity:
29 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
30 / 50
Sorting can be in _________
31 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
32 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
33 / 50
_______________ is a graphical representation of an algorithm
34 / 50
35 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
36 / 50
What type of instructions Random Access Machine (RAM) can execute?
37 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
38 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
39 / 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.
40 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
41 / 50
Sieve Technique can be applied to selection problem?
42 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
43 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
44 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
45 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
46 / 50
Which may be stable sort:
47 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
48 / 50
Due to left complete nature of binary tree, the heap can be stored in
49 / 50
How much time merge sort takes for an array of numbers?
50 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
Your score is
The average score is 40%
Restart quiz
