CS502-Midterm
1 / 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.
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 sieve technique works in ___________ as follows
4 / 50
The Knapsack problem belongs to the domain of _______________ problems.
5 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
6 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
7 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
8 / 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.
9 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
10 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
11 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
12 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
13 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
14 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
15 / 50
Divide-and-conquer as breaking the problem into a small number of
16 / 50
After sorting in merge sort algorithm, merging process is invoked.
17 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
18 / 50
For the heap sort we store the tree nodes in
19 / 50
Which may be a stable sort?
20 / 50
Quick sort is
21 / 50
The running time of quick sort depends heavily on the selection of
22 / 50
Which may be stable sort:
23 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
24 / 50
In plane sweep approach, a vertical line is swept across the 2d-plane and _______structure is used for holding the maximal points lying to the left of the sweep line.
25 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
26 / 50
The number of nodes in a complete binary tree of height h is
27 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
28 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
29 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
30 / 50
The sieve technique is a special case, where the number of sub problems is just
31 / 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,
32 / 50
Counting sort has time complexity:
33 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
34 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
35 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
36 / 50
In which order we can sort?
37 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
38 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
39 / 50
When we call heapify then at each level the comparison performed takes time
40 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
41 / 50
Efficient algorithm requires less computational…….
42 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
43 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
44 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
45 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
46 / 50
In Heap Sort algorithm, if heap property is violated _________
47 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
48 / 50
In Quick Sort Constants hidden in T(n log n) are
49 / 50
Random access machine or RAM is a/an
50 / 50
Is it possible to sort without making comparisons?
Your score is
The average score is 40%
Restart quiz
