CS502-Midterm
1 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
2 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
3 / 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.
4 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
5 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
6 / 50
Sieve Technique can be applied to selection problem?
7 / 50
Cont sort is suitable to sort the elements in range 1 to k
8 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
9 / 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.
10 / 50
Slow sorting algorithms run in,
11 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
12 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
13 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
14 / 50
Is it possible to sort without making comparisons?
15 / 50
The O-notation is used to state only the asymptotic ________bounds.
16 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
17 / 50
Random access machine or RAM is a/an
18 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
19 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
20 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
21 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
22 / 50
What is the total time to heapify?
23 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
24 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
25 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
26 / 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.
27 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
28 / 50
After sorting in merge sort algorithm, merging process is invoked.
29 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
30 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
31 / 50
32 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
33 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
34 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
35 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
36 / 50
Analysis of Selection algorithm ends up with,
37 / 50
In RAM model instructions are executed
38 / 50
39 / 50
For the Sieve Technique we take time
40 / 50
The sieve technique is a special case, where the number of sub problems is just
41 / 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.
42 / 50
Quick sort is best from the perspective of Locality of reference.
43 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
44 / 50
How much time merge sort takes for an array of numbers?
45 / 50
Sorting can be in _________
46 / 50
The number of nodes in a complete binary tree of height h is
47 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
48 / 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.
49 / 50
A RAM is an idealized machine with ______________ random-access memory.
50 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
Your score is
The average score is 40%
Restart quiz
