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
What type of instructions Random Access Machine (RAM) can execute?
3 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
4 / 50
Algorithm is concerned with.......issues.
5 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
6 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
7 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
8 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
9 / 50
One Example of in place but not stable sort is
10 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
11 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
12 / 50
In Sieve Technique we do not know which item is of interest
13 / 50
Cont sort is suitable to sort the elements in range 1 to k
14 / 50
Sorting can be in _________
15 / 50
The O-notation is used to state only the asymptotic ________bounds.
16 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
17 / 50
Random access machine or RAM is a/an
18 / 50
Divide-and-conquer as breaking the problem into a small number of
19 / 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.
20 / 50
The sieve technique works in ___________ as follows
21 / 50
Quick sort is best from the perspective of Locality of reference.
22 / 50
For the heap sort, access to nodes involves simple _______________ operations.
23 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
24 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
25 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
26 / 50
In Quick Sort Constants hidden in T(n log n) are
27 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
28 / 50
For the worst-case running time analysis, the nested loop structure containing one “for” and one “while” loop, might be expressed as a pair of _________nested summations.
29 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
30 / 50
Which sorting algorithm is faster
31 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
32 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
33 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
34 / 50
_______________ is a graphical representation of an algorithm
35 / 50
A heap is a left-complete binary tree that conforms to the ___________
36 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
37 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
38 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
39 / 50
Slow sorting algorithms run in,
40 / 50
After sorting in merge sort algorithm, merging process is invoked.
41 / 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.
42 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
43 / 50
In simple brute-force algorithm, we give no thought to efficiency.
44 / 50
For the Sieve Technique we take time
45 / 50
46 / 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.
47 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
48 / 50
One example of in place but not stable algorithm is
49 / 50
50 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
Your score is
The average score is 40%
Restart quiz
