CS502-Midterm
1 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
2 / 50
Which may be stable sort:
3 / 50
How much time merge sort takes for an array of numbers?
4 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
5 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
6 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
7 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
8 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
9 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
10 / 50
Cont sort is suitable to sort the elements in range 1 to k
11 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
12 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
13 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
14 / 50
The O-notation is used to state only the asymptotic ________bounds.
15 / 50
Counting sort has time complexity:
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
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
18 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
19 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
20 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
21 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
22 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
23 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
24 / 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.
25 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
26 / 50
44.The running time of an algorithm would not depend upon the optimization by the compiler but that of an implementation of the algorithm would depend on it.
27 / 50
After sorting in merge sort algorithm, merging process is invoked.
28 / 50
For the Sieve Technique we take time
29 / 50
In Sieve Technique we do not know which item is of interest
30 / 50
What is the total time to heapify?
31 / 50
Quick sort is
32 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
33 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
34 / 50
A heap is a left-complete binary tree that conforms to the ___________
35 / 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.
36 / 50
The sieve technique is a special case, where the number of sub problems is just
37 / 50
What type of instructions Random Access Machine (RAM) can execute?
38 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
39 / 50
In Quick Sort Constants hidden in T(n log n) are
40 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
41 / 50
In Heap Sort algorithm, if heap property is violated _________
42 / 50
The running time of quick sort depends heavily on the selection of
43 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
44 / 50
When we call heapify then at each level the comparison performed takes time
45 / 50
In simple brute-force algorithm, we give no thought to efficiency.
46 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
47 / 50
One Example of in place but not stable sort is
48 / 50
49 / 50
50 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
Your score is
The average score is 40%
Restart quiz
