CS502-Midterm
1 / 50
What type of instructions Random Access Machine (RAM) can execute?
2 / 50
After sorting in merge sort algorithm, merging process is invoked.
3 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
4 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
5 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
6 / 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.
7 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
8 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
9 / 50
Random access machine or RAM is a/an
10 / 50
Algorithm is concerned with.......issues.
11 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
12 / 50
In Sieve Technique we do not know which item is of interest
13 / 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,
14 / 50
The running time of quick sort depends heavily on the selection of
15 / 50
16 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
17 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
18 / 50
In which order we can sort?
19 / 50
The sieve technique works in ___________ as follows
20 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
21 / 50
In simple brute-force algorithm, we give no thought to efficiency.
22 / 50
How much time merge sort takes for an array of numbers?
23 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
24 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
25 / 50
In RAM model instructions are executed
26 / 50
Which may be a stable sort?
27 / 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.
28 / 50
When we call heapify then at each level the comparison performed takes time
29 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
30 / 50
Analysis of Selection algorithm ends up with,
31 / 50
One Example of in place but not stable sort is
32 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
33 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
34 / 50
Cont sort is suitable to sort the elements in range 1 to k
35 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
36 / 50
Quick sort is
37 / 50
In ____________ we have to find rank of an element from given input.
38 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
39 / 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
40 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
41 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
42 / 50
Which may be stable sort:
43 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
44 / 50
For the Sieve Technique we take time
45 / 50
44.The running time of an algorithm would not depend upon the optimization by the compiler but that of an implementation of the algorithm would depend on it.
46 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
47 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
48 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
49 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
50 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
Your score is
The average score is 40%
Restart quiz
