CS502-Midterm
1 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
2 / 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.
3 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
4 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
5 / 50
Sorting can be in _________
6 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
7 / 50
In RAM model instructions are executed
8 / 50
The Knapsack problem belongs to the domain of _______________ problems.
9 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
10 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
11 / 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.
12 / 50
In simple brute-force algorithm, we give no thought to efficiency.
13 / 50
Random access machine or RAM is a/an
14 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
15 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
16 / 50
Quick sort is
17 / 50
In Quick Sort Constants hidden in T(n log n) are
18 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
19 / 50
Sieve Technique can be applied to selection problem?
20 / 50
In which order we can sort?
21 / 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.
22 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
23 / 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.
24 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
25 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
26 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
27 / 50
Cont sort is suitable to sort the elements in range 1 to k
28 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
29 / 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.
30 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
31 / 50
Analysis of Selection algorithm ends up with,
32 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
33 / 50
In Sieve Technique we do not know which item is of interest
34 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
35 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
36 / 50
A heap is a left-complete binary tree that conforms to the ___________
37 / 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,
38 / 50
The O-notation is used to state only the asymptotic ________bounds.
39 / 50
40 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
41 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
42 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
43 / 50
In ____________ we have to find rank of an element from given input.
44 / 50
Quick sort is best from the perspective of Locality of reference.
45 / 50
Which sorting algorithm is faster
46 / 50
One Example of in place but not stable sort is
47 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
48 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
49 / 50
50 / 50
What type of instructions Random Access Machine (RAM) can execute?
Your score is
The average score is 40%
Restart quiz
