CS502-Midterm
1 / 50
Analysis of Selection algorithm ends up with,
2 / 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.
3 / 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.
4 / 50
In Heap Sort algorithm, if heap property is violated _________
5 / 50
Random access machine or RAM is a/an
6 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
7 / 50
_______________ is a graphical representation of an algorithm
8 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
9 / 50
One example of in place but not stable algorithm is
10 / 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.
11 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
12 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
13 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
14 / 50
In Sieve Technique we do not know which item is of interest
15 / 50
Cont sort is suitable to sort the elements in range 1 to k
16 / 50
A RAM is an idealized machine with ______________ random-access memory.
17 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
18 / 50
Which sorting algorithm is faster
19 / 50
What is the total time to heapify?
20 / 50
For the heap sort, access to nodes involves simple _______________ operations.
21 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
22 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
23 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
24 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
25 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
26 / 50
The Knapsack problem belongs to the domain of _______________ problems.
27 / 50
One Example of in place but not stable sort is
28 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
29 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
30 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
31 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
32 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
33 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
34 / 50
Quick sort is
35 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
36 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
37 / 50
In simple brute-force algorithm, we give no thought to efficiency.
38 / 50
39 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
40 / 50
41 / 50
Divide-and-conquer as breaking the problem into a small number of
42 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
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
The sieve technique works in ___________ as follows
45 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
46 / 50
Sieve Technique can be applied to selection problem?
47 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
48 / 50
49 / 50
The number of nodes in a complete binary tree of height h is
50 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
Your score is
The average score is 40%
Restart quiz
