CS502-Midterm
1 / 50
One Example of in place but not stable sort is
2 / 50
The Knapsack problem belongs to the domain of _______________ problems.
3 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
4 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
5 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
6 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
7 / 50
The sieve technique works in ___________ as follows
8 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
9 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
10 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
11 / 50
The O-notation is used to state only the asymptotic ________bounds.
12 / 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.
13 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
14 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
15 / 50
The number of nodes in a complete binary tree of height h is
16 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
17 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
18 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
19 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
20 / 50
Analysis of Selection algorithm ends up with,
21 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
22 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
23 / 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.
24 / 50
Which may be stable sort:
25 / 50
Quick sort is best from the perspective of Locality of reference.
26 / 50
Which may be a stable sort?
27 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
28 / 50
When we call heapify then at each level the comparison performed takes time
29 / 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,
30 / 50
What is the total time to heapify?
31 / 50
Sorting can be in _________
32 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
33 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
34 / 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.
35 / 50
What type of instructions Random Access Machine (RAM) can execute?
36 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
37 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
38 / 50
Divide-and-conquer as breaking the problem into a small number of
39 / 50
A heap is a left-complete binary tree that conforms to the ___________
40 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
41 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
42 / 50
Is it possible to sort without making comparisons?
43 / 50
Quick sort is
44 / 50
In simple brute-force algorithm, we give no thought to efficiency.
45 / 50
In Sieve Technique we do not know which item is of interest
46 / 50
Random access machine or RAM is a/an
47 / 50
In which order we can sort?
48 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
49 / 50
Due to left complete nature of binary tree, the heap can be stored in
50 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
Your score is
The average score is 40%
Restart quiz
