CS502-Midterm
1 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
2 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
3 / 50
______________ graphical representation of algorithm.
4 / 50
Quick sort is
5 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
6 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
7 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
8 / 50
In ____________ we have to find rank of an element from given input.
9 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
10 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
11 / 50
When we call heapify then at each level the comparison performed takes time
12 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
13 / 50
The Knapsack problem belongs to the domain of _______________ problems.
14 / 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
15 / 50
A heap is a left-complete binary tree that conforms to the ___________
16 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
17 / 50
Slow sorting algorithms run in,
18 / 50
In Sieve Technique we do not know which item is of interest
19 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
20 / 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,
21 / 50
Due to left complete nature of binary tree, the heap can be stored in
22 / 50
Efficient algorithm requires less computational…….
23 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
24 / 50
What is the total time to heapify?
25 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
26 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
27 / 50
Algorithm is concerned with.......issues.
28 / 50
Quick sort is best from the perspective of Locality of reference.
29 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
30 / 50
Sieve Technique can be applied to selection problem?
31 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
32 / 50
Counting sort has time complexity:
33 / 50
What type of instructions Random Access Machine (RAM) can execute?
34 / 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.
35 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
36 / 50
Which may be stable sort:
37 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
38 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
39 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
40 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
41 / 50
Divide-and-conquer as breaking the problem into a small number of
42 / 50
In simple brute-force algorithm, we give no thought to efficiency.
43 / 50
44 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
45 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
46 / 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.
47 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
48 / 50
The sieve technique works in ___________ as follows
49 / 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.
50 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
Your score is
The average score is 40%
Restart quiz
