CS502-Midterm
1 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
2 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
3 / 50
4 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
5 / 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.
6 / 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.
7 / 50
In Quick Sort Constants hidden in T(n log n) are
8 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
9 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
10 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
11 / 50
In simple brute-force algorithm, we give no thought to efficiency.
12 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
13 / 50
One example of in place but not stable algorithm is
14 / 50
What type of instructions Random Access Machine (RAM) can execute?
15 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
16 / 50
Sieve Technique can be applied to selection problem?
17 / 50
_______________ is a graphical representation of an algorithm
18 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
19 / 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.
20 / 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.
21 / 50
Analysis of Selection algorithm ends up with,
22 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
23 / 50
Which may be a stable sort?
24 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
25 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
26 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
27 / 50
How much time merge sort takes for an array of numbers?
28 / 50
Efficient algorithm requires less computational…….
29 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
30 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
31 / 50
Sorting can be in _________
32 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
33 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
34 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
35 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
36 / 50
In Sieve Technique we do not know which item is of interest
37 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
38 / 50
For the heap sort we store the tree nodes in
39 / 50
Slow sorting algorithms run in,
40 / 50
41 / 50
42 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
43 / 50
For the sieve technique we solve the problem,
44 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
45 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
46 / 50
The Knapsack problem belongs to the domain of _______________ problems.
47 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
48 / 50
The O-notation is used to state only the asymptotic ________bounds.
49 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
50 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
Your score is
The average score is 40%
Restart quiz
