CS502-Midterm
1 / 50
In simple brute-force algorithm, we give no thought to efficiency.
2 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
3 / 50
______________ graphical representation of algorithm.
4 / 50
Which may be a stable sort?
5 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
6 / 50
In RAM model instructions are executed
7 / 50
In Sieve Technique we do not know which item is of interest
8 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
9 / 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,
10 / 50
In Quick Sort Constants hidden in T(n log n) are
11 / 50
How much time merge sort takes for an array of numbers?
12 / 50
A RAM is an idealized machine with ______________ random-access memory.
13 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
14 / 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.
15 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
16 / 50
In Heap Sort algorithm, if heap property is violated _________
17 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
18 / 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.
19 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
20 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
21 / 50
For the Sieve Technique we take time
22 / 50
Sorting can be in _________
23 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
24 / 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.
25 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
26 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
27 / 50
Random access machine or RAM is a/an
28 / 50
For the heap sort, access to nodes involves simple _______________ operations.
29 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
30 / 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.
31 / 50
Divide-and-conquer as breaking the problem into a small number of
32 / 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.
33 / 50
The Knapsack problem belongs to the domain of _______________ problems.
34 / 50
One Example of in place but not stable sort is
35 / 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.
36 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
37 / 50
38 / 50
39 / 50
Efficient algorithm requires less computational…….
40 / 50
Counting sort has time complexity:
41 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
42 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
43 / 50
Analysis of Selection algorithm ends up with,
44 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
45 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
46 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
47 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
48 / 50
The running time of quick sort depends heavily on the selection of
49 / 50
The sieve technique works in ___________ as follows
50 / 50
Quick sort is best from the perspective of Locality of reference.
Your score is
The average score is 40%
Restart quiz
