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
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
3 / 50
After sorting in merge sort algorithm, merging process is invoked.
4 / 50
One example of in place but not stable algorithm is
5 / 50
In RAM model instructions are executed
6 / 50
Cont sort is suitable to sort the elements in range 1 to k
7 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
8 / 50
Due to left complete nature of binary tree, the heap can be stored in
9 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
10 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
11 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
12 / 50
Which may be a stable sort?
13 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
14 / 50
Quick sort is best from the perspective of Locality of reference.
15 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
16 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
17 / 50
The number of nodes in a complete binary tree of height h is
18 / 50
In Sieve Technique we do not know which item is of interest
19 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
20 / 50
Algorithm is concerned with.......issues.
21 / 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.
22 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
23 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
24 / 50
Slow sorting algorithms run in,
25 / 50
In Quick Sort Constants hidden in T(n log n) are
26 / 50
Random access machine or RAM is a/an
27 / 50
For the heap sort, access to nodes involves simple _______________ operations.
28 / 50
Sorting can be in _________
29 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
30 / 50
For the sieve technique we solve the problem,
31 / 50
32 / 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.
33 / 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.
34 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
35 / 50
Counting sort has time complexity:
36 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
37 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
38 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
39 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
40 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
41 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
42 / 50
What is the total time to heapify?
43 / 50
The sieve technique works in ___________ as follows
44 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
45 / 50
The running time of quick sort depends heavily on the selection of
46 / 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
47 / 50
The Knapsack problem belongs to the domain of _______________ problems.
48 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
49 / 50
50 / 50
Which sorting algorithm is faster
Your score is
The average score is 40%
Restart quiz
