CS502-Midterm
1 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
2 / 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.
3 / 50
Which may be a stable sort?
4 / 50
In ____________ we have to find rank of an element from given input.
5 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
6 / 50
For the heap sort we store the tree nodes in
7 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
8 / 50
In Heap Sort algorithm, if heap property is violated _________
9 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
10 / 50
For the heap sort, access to nodes involves simple _______________ operations.
11 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
12 / 50
Due to left complete nature of binary tree, the heap can be stored in
13 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
14 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
15 / 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
16 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
17 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
18 / 50
Which sorting algorithm is faster
19 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
20 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
21 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
22 / 50
In simple brute-force algorithm, we give no thought to efficiency.
23 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
24 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
25 / 50
The number of nodes in a complete binary tree of height h is
26 / 50
What type of instructions Random Access Machine (RAM) can execute?
27 / 50
One example of in place but not stable algorithm is
28 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
29 / 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.
30 / 50
______________ graphical representation of algorithm.
31 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
32 / 50
The running time of quick sort depends heavily on the selection of
33 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
34 / 50
What is the total time to heapify?
35 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
36 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
37 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
38 / 50
Quick sort is
39 / 50
In Sieve Technique we do not know which item is of interest
40 / 50
Sieve Technique can be applied to selection problem?
41 / 50
In RAM model instructions are executed
42 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
43 / 50
The sieve technique is a special case, where the number of sub problems is just
44 / 50
Efficient algorithm requires less computational…….
45 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
46 / 50
Slow sorting algorithms run in,
47 / 50
How much time merge sort takes for an array of numbers?
48 / 50
In which order we can sort?
49 / 50
After sorting in merge sort algorithm, merging process is invoked.
50 / 50
For the sieve technique we solve the problem,
Your score is
The average score is 40%
Restart quiz
