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
The O-notation is used to state only the asymptotic ________bounds.
3 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
4 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
5 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
6 / 50
Efficient algorithm requires less computational…….
7 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
8 / 50
Random access machine or RAM is a/an
9 / 50
The sieve technique is a special case, where the number of sub problems is just
10 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
11 / 50
The Knapsack problem belongs to the domain of _______________ problems.
12 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
13 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
14 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
15 / 50
Which may be stable sort:
16 / 50
What is the total time to heapify?
17 / 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.
18 / 50
Is it possible to sort without making comparisons?
19 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
20 / 50
______________ graphical representation of algorithm.
21 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
22 / 50
Cont sort is suitable to sort the elements in range 1 to k
23 / 50
One example of in place but not stable algorithm is
24 / 50
Quick sort is best from the perspective of Locality of reference.
25 / 50
_______________ is a graphical representation of an algorithm
26 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
27 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
28 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
29 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
30 / 50
The function f(n)= n(logn+1)/2 is asymptotically equivalent to n log n. Here Upper Bound means the function f(n) grows asymptotically ____________ faster than n log n.
31 / 50
Divide-and-conquer as breaking the problem into a small number of
32 / 50
In Heap Sort algorithm, if heap property is violated _________
33 / 50
In RAM model instructions are executed
34 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
35 / 50
Sorting can be in _________
36 / 50
Due to left complete nature of binary tree, the heap can be stored in
37 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
38 / 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.
39 / 50
40 / 50
In Sieve Technique we do not know which item is of interest
41 / 50
42 / 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.
43 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
44 / 50
Algorithm is concerned with.......issues.
45 / 50
The number of nodes in a complete binary tree of height h is
46 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
47 / 50
In ____________ we have to find rank of an element from given input.
48 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
49 / 50
Counting sort has time complexity:
50 / 50
Sieve Technique can be applied to selection problem?
Your score is
The average score is 40%
Restart quiz
