CS502-Midterm
1 / 50
Sorting can be in _________
2 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
3 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
4 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
5 / 50
In ____________ we have to find rank of an element from given input.
6 / 50
Due to left complete nature of binary tree, the heap can be stored in
7 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
8 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
9 / 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
10 / 50
______________ graphical representation of algorithm.
11 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
12 / 50
For the heap sort we store the tree nodes in
13 / 50
When we call heapify then at each level the comparison performed takes time
14 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
15 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
16 / 50
What is the total time to heapify?
17 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
18 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
19 / 50
Analysis of Selection algorithm ends up with,
20 / 50
In Sieve Technique we do not know which item is of interest
21 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
22 / 50
A RAM is an idealized machine with ______________ random-access memory.
23 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
24 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
25 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
26 / 50
The sieve technique is a special case, where the number of sub problems is just
27 / 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,
28 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
29 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
30 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
31 / 50
32 / 50
Efficient algorithm requires less computational…….
33 / 50
For the sieve technique we solve the problem,
34 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
35 / 50
What type of instructions Random Access Machine (RAM) can execute?
36 / 50
Random access machine or RAM is a/an
37 / 50
The number of nodes in a complete binary tree of height h is
38 / 50
The function f(n)= n(logn+1)/2 is asymptotically equivalent to n log n. Here Upper Bound means the function f(n) grows asymptotically ____________ faster than n log n.
39 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
40 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
41 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
42 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
43 / 50
The sieve technique works in ___________ as follows
44 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
45 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
46 / 50
Which sorting algorithm is faster
47 / 50
Quick sort is best from the perspective of Locality of reference.
48 / 50
Counting sort has time complexity:
49 / 50
Which may be a stable sort?
50 / 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.
Your score is
The average score is 40%
Restart quiz
