CS502-Midterm
1 / 50
Which sorting algorithm is faster
2 / 50
How much time merge sort takes for an array of numbers?
3 / 50
For the Sieve Technique we take time
4 / 50
Algorithm is concerned with.......issues.
5 / 50
Which may be a stable sort?
6 / 50
In RAM model instructions are executed
7 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
8 / 50
Sorting can be in _________
9 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
10 / 50
Cont sort is suitable to sort the elements in range 1 to k
11 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
12 / 50
In Sieve Technique we do not know which item is of interest
13 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
14 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
15 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
16 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
17 / 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.
18 / 50
In simple brute-force algorithm, we give no thought to efficiency.
19 / 50
In ____________ we have to find rank of an element from given input.
20 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
21 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
22 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
23 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
24 / 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.
25 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
26 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
27 / 50
Sieve Technique can be applied to selection problem?
28 / 50
The sieve technique is a special case, where the number of sub problems is just
29 / 50
In Heap Sort algorithm, if heap property is violated _________
30 / 50
For the heap sort we store the tree nodes in
31 / 50
In Quick Sort Constants hidden in T(n log n) are
32 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
33 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
34 / 50
One example of in place but not stable algorithm is
35 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
36 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
37 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
38 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
39 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
40 / 50
A heap is a left-complete binary tree that conforms to the ___________
41 / 50
42 / 50
The Knapsack problem belongs to the domain of _______________ problems.
43 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
44 / 50
Is it possible to sort without making comparisons?
45 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
46 / 50
Random access machine or RAM is a/an
47 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
48 / 50
49 / 50
The running time of quick sort depends heavily on the selection of
50 / 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.
Your score is
The average score is 40%
Restart quiz
