CS502-Midterm
1 / 50
Slow sorting algorithms run in,
2 / 50
______________ graphical representation of algorithm.
3 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
4 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
5 / 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.
6 / 50
What is the total time to heapify?
7 / 50
Sorting can be in _________
8 / 50
For the heap sort we store the tree nodes in
9 / 50
Which sorting algorithm is faster
10 / 50
What type of instructions Random Access Machine (RAM) can execute?
11 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
12 / 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.
13 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
14 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
15 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
16 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
17 / 50
Random access machine or RAM is a/an
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
Algorithm is concerned with.......issues.
21 / 50
One Example of in place but not stable sort is
22 / 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.
23 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
24 / 50
For the sieve technique we solve the problem,
25 / 50
Analysis of Selection algorithm ends up with,
26 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
27 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
28 / 50
29 / 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,
30 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
31 / 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
32 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
33 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
34 / 50
_______________ is a graphical representation of an algorithm
35 / 50
In ____________ we have to find rank of an element from given input.
36 / 50
Quick sort is best from the perspective of Locality of reference.
37 / 50
After sorting in merge sort algorithm, merging process is invoked.
38 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
39 / 50
In Quick Sort Constants hidden in T(n log n) are
40 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
41 / 50
42 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
43 / 50
Sieve Technique can be applied to selection problem?
44 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
45 / 50
Cont sort is suitable to sort the elements in range 1 to k
46 / 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.
47 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
48 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
49 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
50 / 50
Counting sort has time complexity:
Your score is
The average score is 40%
Restart quiz
