CS502-Midterm
1 / 50
For the heap sort we store the tree nodes in
2 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
3 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
4 / 50
Which sorting algorithm is faster
5 / 50
How much time merge sort takes for an array of numbers?
6 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
7 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
8 / 50
A RAM is an idealized machine with ______________ random-access memory.
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
What is the total time to heapify?
11 / 50
In Sieve Technique we do not know which item is of interest
12 / 50
When we call heapify then at each level the comparison performed takes time
13 / 50
Which may be a stable sort?
14 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
15 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
16 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
17 / 50
For the heap sort, access to nodes involves simple _______________ operations.
18 / 50
For the Sieve Technique we take time
19 / 50
20 / 50
Quick sort is best from the perspective of Locality of reference.
21 / 50
In RAM model instructions are executed
22 / 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.
23 / 50
______________ graphical representation of algorithm.
24 / 50
Cont sort is suitable to sort the elements in range 1 to k
25 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
26 / 50
Quick sort is
27 / 50
After sorting in merge sort algorithm, merging process is invoked.
28 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
29 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
30 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
31 / 50
For the sieve technique we solve the problem,
32 / 50
In which order we can sort?
33 / 50
Is it possible to sort without making comparisons?
34 / 50
In Quick Sort Constants hidden in T(n log n) are
35 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
36 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
37 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
38 / 50
The O-notation is used to state only the asymptotic ________bounds.
39 / 50
Which may be stable sort:
40 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
41 / 50
42 / 50
43 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
44 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
45 / 50
The sieve technique is a special case, where the number of sub problems is just
46 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
47 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
48 / 50
The number of nodes in a complete binary tree of height h is
49 / 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.
50 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
Your score is
The average score is 40%
Restart quiz
