CS502-Midterm
1 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
2 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
3 / 50
_______________ is a graphical representation of an algorithm
4 / 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.
5 / 50
Algorithm is concerned with.......issues.
6 / 50
Quick sort is best from the perspective of Locality of reference.
7 / 50
For the Sieve Technique we take time
8 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
9 / 50
What is the total time to heapify?
10 / 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.
11 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
12 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
13 / 50
The sieve technique works in ___________ as follows
14 / 50
The number of nodes in a complete binary tree of height h is
15 / 50
A RAM is an idealized machine with ______________ random-access memory.
16 / 50
Sieve Technique can be applied to selection problem?
17 / 50
In Sieve Technique we do not know which item is of interest
18 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
19 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
20 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
21 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
22 / 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
23 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
24 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
25 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
26 / 50
Which may be stable sort:
27 / 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.
28 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
29 / 50
How much time merge sort takes for an array of numbers?
30 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
31 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
32 / 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.
33 / 50
Due to left complete nature of binary tree, the heap can be stored in
34 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
35 / 50
In Heap Sort algorithm, if heap property is violated _________
36 / 50
Quick sort is
37 / 50
Counting sort has time complexity:
38 / 50
39 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
40 / 50
______________ graphical representation of algorithm.
41 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
42 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
43 / 50
For the sieve technique we solve the problem,
44 / 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.
45 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
46 / 50
The O-notation is used to state only the asymptotic ________bounds.
47 / 50
In simple brute-force algorithm, we give no thought to efficiency.
48 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
49 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
50 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
Your score is
The average score is 40%
Restart quiz
