CS502-Midterm
1 / 50
In Sieve Technique we do not know which item is of interest
2 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
3 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
4 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
5 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
6 / 50
The sieve technique works in ___________ as follows
7 / 50
Sieve Technique can be applied to selection problem?
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
In simple brute-force algorithm, we give no thought to efficiency.
10 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
11 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
12 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
13 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
14 / 50
When we call heapify then at each level the comparison performed takes time
15 / 50
Which sorting algorithm is faster
16 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
17 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
18 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
19 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
20 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
21 / 50
______________ graphical representation of algorithm.
22 / 50
The sieve technique is a special case, where the number of sub problems is just
23 / 50
Algorithm is concerned with.......issues.
24 / 50
The Knapsack problem belongs to the domain of _______________ problems.
25 / 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.
26 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
27 / 50
Random access machine or RAM is a/an
28 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
29 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
30 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
31 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
32 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
33 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
34 / 50
Is it possible to sort without making comparisons?
35 / 50
36 / 50
For the Sieve Technique we take time
37 / 50
38 / 50
In Quick Sort Constants hidden in T(n log n) are
39 / 50
40 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
41 / 50
One Example of in place but not stable sort is
42 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
43 / 50
For the heap sort we store the tree nodes in
44 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
45 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
46 / 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.
47 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
48 / 50
The running time of quick sort depends heavily on the selection of
49 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
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
