CS502-Midterm
1 / 50
Slow sorting algorithms run in,
2 / 50
Which may be stable sort:
3 / 50
Is it possible to sort without making comparisons?
4 / 50
When we call heapify then at each level the comparison performed takes time
5 / 50
_______________ is a graphical representation of an algorithm
6 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
7 / 50
For the Sieve Technique we take time
8 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
9 / 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.
10 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
11 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
12 / 50
13 / 50
The running time of quick sort depends heavily on the selection of
14 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
15 / 50
The sieve technique works in ___________ as follows
16 / 50
Efficient algorithm requires less computational…….
17 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
18 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
19 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
20 / 50
In ____________ we have to find rank of an element from given input.
21 / 50
In RAM model instructions are executed
22 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
23 / 50
Which sorting algorithm is faster
24 / 50
Counting sort has time complexity:
25 / 50
In Quick Sort Constants hidden in T(n log n) are
26 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
27 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
28 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
29 / 50
In Sieve Technique we do not know which item is of interest
30 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
31 / 50
The number of nodes in a complete binary tree of height h is
32 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
33 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
34 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
35 / 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
36 / 50
37 / 50
For the sieve technique we solve the problem,
38 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
39 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
40 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
41 / 50
For the heap sort, access to nodes involves simple _______________ operations.
42 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
43 / 50
44 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
45 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
46 / 50
Which may be a stable sort?
47 / 50
Consider the following code:
For(j=1; j
For(k=1; k<15;k++)
For(l=5; l
{
Do_something_constant();
}
What is the order of execution for this code.
48 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
49 / 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,
50 / 50
The sieve technique is a special case, where the number of sub problems is just
Your score is
The average score is 40%
Restart quiz
