CS502-Midterm
1 / 50
Divide-and-conquer as breaking the problem into a small number of
2 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
3 / 50
A RAM is an idealized machine with ______________ random-access memory.
4 / 50
For the heap sort we store the tree nodes in
5 / 50
Random access machine or RAM is a/an
6 / 50
Efficient algorithm requires less computational…….
7 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
8 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
9 / 50
For the heap sort, access to nodes involves simple _______________ operations.
10 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
11 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
12 / 50
The running time of quick sort depends heavily on the selection of
13 / 50
_______________ is a graphical representation of an algorithm
14 / 50
After sorting in merge sort algorithm, merging process is invoked.
15 / 50
Analysis of Selection algorithm ends up with,
16 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
17 / 50
Counting sort has time complexity:
18 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
19 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
20 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
21 / 50
What is the total time to heapify?
22 / 50
What type of instructions Random Access Machine (RAM) can execute?
23 / 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,
24 / 50
25 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
26 / 50
Cont sort is suitable to sort the elements in range 1 to k
27 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
28 / 50
The Knapsack problem belongs to the domain of _______________ problems.
29 / 50
One Example of in place but not stable sort is
30 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
31 / 50
One example of in place but not stable algorithm is
32 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
33 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
34 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
35 / 50
In simple brute-force algorithm, we give no thought to efficiency.
36 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
37 / 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.
38 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
39 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
40 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
41 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
42 / 50
For the Sieve Technique we take time
43 / 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.
44 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
45 / 50
Is it possible to sort without making comparisons?
46 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
47 / 50
Which may be a stable sort?
48 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
49 / 50
Slow sorting algorithms run in,
50 / 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.
Your score is
The average score is 40%
Restart quiz
