CS502-Midterm
1 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
2 / 50
Slow sorting algorithms run in,
3 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
4 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
5 / 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.
6 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
7 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
8 / 50
Algorithm is concerned with.......issues.
9 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
10 / 50
How much time merge sort takes for an array of numbers?
11 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
12 / 50
Efficient algorithm requires less computational…….
13 / 50
In Sieve Technique we do not know which item is of interest
14 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
15 / 50
The running time of quick sort depends heavily on the selection of
16 / 50
If we associate (x, y) integers pair to cars where x is the speed of the car and y is the negation of the price. High y value for a car means a ________ car.
17 / 50
In which order we can sort?
18 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
19 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
20 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
21 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
22 / 50
A RAM is an idealized machine with ______________ random-access memory.
23 / 50
Which may be a stable sort?
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
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
26 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
27 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
28 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
29 / 50
30 / 50
In Quick Sort Constants hidden in T(n log n) are
31 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
32 / 50
33 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
34 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
35 / 50
Is it possible to sort without making comparisons?
36 / 50
Which may be stable sort:
37 / 50
38 / 50
______________ graphical representation of algorithm.
39 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
40 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
41 / 50
Cont sort is suitable to sort the elements in range 1 to k
42 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
43 / 50
Due to left complete nature of binary tree, the heap can be stored in
44 / 50
What is the total time to heapify?
45 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
46 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
47 / 50
The O-notation is used to state only the asymptotic ________bounds.
48 / 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
49 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
50 / 50
Sieve Technique can be applied to selection problem?
Your score is
The average score is 40%
Restart quiz
