CS502-Midterm
1 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
2 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
3 / 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.
4 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
5 / 50
Due to left complete nature of binary tree, the heap can be stored in
6 / 50
For the heap sort we store the tree nodes in
7 / 50
Which may be stable sort:
8 / 50
In Heap Sort algorithm, if heap property is violated _________
9 / 50
In ____________ we have to find rank of an element from given input.
10 / 50
How much time merge sort takes for an array of numbers?
11 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
12 / 50
Sorting can be in _________
13 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
14 / 50
For the heap sort, access to nodes involves simple _______________ operations.
15 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
16 / 50
The function f(n)=n(logn+1)/2 is asymptotically equivalent to nlog n. Here Lower Bound means function f(n) grows asymptotically at ____________ as fast as nlog n.
17 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
18 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
19 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
20 / 50
Algorithm is concerned with.......issues.
21 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
22 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
23 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
24 / 50
In Quick Sort Constants hidden in T(n log n) are
25 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
26 / 50
A heap is a left-complete binary tree that conforms to the ___________
27 / 50
Efficient algorithm requires less computational…….
28 / 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.
29 / 50
_______________ is a graphical representation of an algorithm
30 / 50
Which sorting algorithm is faster
31 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
32 / 50
The sieve technique is a special case, where the number of sub problems is just
33 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
34 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
35 / 50
In Sieve Technique we do not know which item is of interest
36 / 50
37 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
38 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
39 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
40 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
41 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
42 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
43 / 50
For the sieve technique we solve the problem,
44 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
45 / 50
Analysis of Selection algorithm ends up with,
46 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
47 / 50
In simple brute-force algorithm, we give no thought to efficiency.
48 / 50
Divide-and-conquer as breaking the problem into a small number of
49 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
50 / 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
Your score is
The average score is 40%
Restart quiz
