CS502-Midterm
1 / 50
The sieve technique works in ___________ as follows
2 / 50
For the sieve technique we solve the problem,
3 / 50
The O-notation is used to state only the asymptotic ________bounds.
4 / 50
The Knapsack problem belongs to the domain of _______________ problems.
5 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
6 / 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.
7 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
8 / 50
Quick sort is best from the perspective of Locality of reference.
9 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
10 / 50
Due to left complete nature of binary tree, the heap can be stored in
11 / 50
In Sieve Technique we do not know which item is of interest
12 / 50
What type of instructions Random Access Machine (RAM) can execute?
13 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
14 / 50
Cont sort is suitable to sort the elements in range 1 to k
15 / 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.
16 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
17 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
18 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
19 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
20 / 50
Sorting can be in _________
21 / 50
For the heap sort we store the tree nodes in
22 / 50
What is the total time to heapify?
23 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
24 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
25 / 50
Which sorting algorithm is faster
26 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
27 / 50
In Heap Sort algorithm, if heap property is violated _________
28 / 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.
29 / 50
After sorting in merge sort algorithm, merging process is invoked.
30 / 50
For the Sieve Technique we take time
31 / 50
In simple brute-force algorithm, we give no thought to efficiency.
32 / 50
In Quick Sort Constants hidden in T(n log n) are
33 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
34 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
35 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
36 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
37 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
38 / 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.
39 / 50
One Example of in place but not stable sort is
40 / 50
The running time of quick sort depends heavily on the selection of
41 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
42 / 50
43 / 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.
44 / 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,
45 / 50
When we call heapify then at each level the comparison performed takes time
46 / 50
Sieve Technique can be applied to selection problem?
47 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
48 / 50
Quick sort is
49 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
50 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
Your score is
The average score is 40%
Restart quiz
