CS502-Midterm
1 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
2 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
3 / 50
The sieve technique is a special case, where the number of sub problems is just
4 / 50
After sorting in merge sort algorithm, merging process is invoked.
5 / 50
In Sieve Technique we do not know which item is of interest
6 / 50
The number of nodes in a complete binary tree of height h is
7 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
8 / 50
For the heap sort we store the tree nodes in
9 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
10 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
11 / 50
Counting sort has time complexity:
12 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
13 / 50
For the Sieve Technique we take time
14 / 50
What is the total time to heapify?
15 / 50
The sieve technique works in ___________ as follows
16 / 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.
17 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
18 / 50
Algorithm is concerned with.......issues.
19 / 50
Quick sort is best from the perspective of Locality of reference.
20 / 50
Is it possible to sort without making comparisons?
21 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
22 / 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,
23 / 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.
24 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
25 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
26 / 50
For the sieve technique we solve the problem,
27 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
28 / 50
The Knapsack problem belongs to the domain of _______________ problems.
29 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
30 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
31 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
32 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
33 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
34 / 50
Quick sort is
35 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
36 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
37 / 50
For the heap sort, access to nodes involves simple _______________ operations.
38 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
39 / 50
Which may be stable sort:
40 / 50
41 / 50
Slow sorting algorithms run in,
42 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
43 / 50
Random access machine or RAM is a/an
44 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
45 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
46 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
47 / 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.
48 / 50
Sieve Technique can be applied to selection problem?
49 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
50 / 50
In which order we can sort?
Your score is
The average score is 40%
Restart quiz
