CS502-Midterm
1 / 50
Sieve Technique can be applied to selection problem?
2 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
3 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
4 / 50
For the heap sort we store the tree nodes in
5 / 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.
6 / 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.
7 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
8 / 50
What is the total time to heapify?
9 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
10 / 50
______________ graphical representation of algorithm.
11 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
12 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
13 / 50
Quick sort is best from the perspective of Locality of reference.
14 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
15 / 50
In ____________ we have to find rank of an element from given input.
16 / 50
Sorting can be in _________
17 / 50
In RAM model instructions are executed
18 / 50
In Quick Sort Constants hidden in T(n log n) are
19 / 50
Quick sort is
20 / 50
For the sieve technique we solve the problem,
21 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
22 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
23 / 50
How much time merge sort takes for an array of numbers?
24 / 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.
25 / 50
Algorithm is concerned with.......issues.
26 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
27 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
28 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
29 / 50
Slow sorting algorithms run in,
30 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
31 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
32 / 50
The sieve technique is a special case, where the number of sub problems is just
33 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
34 / 50
The running time of quick sort depends heavily on the selection of
35 / 50
In Sieve Technique we do not know which item is of interest
36 / 50
In simple brute-force algorithm, we give no thought to efficiency.
37 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
38 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
39 / 50
A RAM is an idealized machine with ______________ random-access memory.
40 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
41 / 50
When we call heapify then at each level the comparison performed takes time
42 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
43 / 50
The number of nodes in a complete binary tree of height h is
44 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
45 / 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
46 / 50
Is it possible to sort without making comparisons?
47 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
48 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
49 / 50
Divide-and-conquer as breaking the problem into a small number of
50 / 50
Which may be a stable sort?
Your score is
The average score is 40%
Restart quiz
