CS502-Midterm
1 / 50
In RAM model instructions are executed
2 / 50
A heap is a left-complete binary tree that conforms to the ___________
3 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
4 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
5 / 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.
6 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
7 / 50
Quick sort is
8 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
9 / 50
The running time of quick sort depends heavily on the selection of
10 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
11 / 50
For the sieve technique we solve the problem,
12 / 50
For the Sieve Technique we take time
13 / 50
What is the total time to heapify?
14 / 50
What type of instructions Random Access Machine (RAM) can execute?
15 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
16 / 50
In Quick Sort Constants hidden in T(n log n) are
17 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
18 / 50
Which may be a stable sort?
19 / 50
How much time merge sort takes for an array of numbers?
20 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
21 / 50
The O-notation is used to state only the asymptotic ________bounds.
22 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
23 / 50
Upper bound requires that there exist positive constants c2 and n0 such that f(n) ____ c2n for all n <= n0(ye question ghalat lag raha hai mujhae
24 / 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.
25 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
26 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
27 / 50
The number of nodes in a complete binary tree of height h is
28 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
29 / 50
In Sieve Technique we do not know which item is of interest
30 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
31 / 50
Counting sort has time complexity:
32 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
33 / 50
Which sorting algorithm is faster
34 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
35 / 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.
36 / 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,
37 / 50
Analysis of Selection algorithm ends up with,
38 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
39 / 50
Algorithm is concerned with.......issues.
40 / 50
41 / 50
In ____________ we have to find rank of an element from given input.
42 / 50
For the heap sort we store the tree nodes in
43 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
44 / 50
Due to left complete nature of binary tree, the heap can be stored in
45 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
46 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
47 / 50
One example of in place but not stable algorithm is
48 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
49 / 50
Slow sorting algorithms run in,
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
