CS502-Midterm
1 / 50
A heap is a left-complete binary tree that conforms to the ___________
2 / 50
Which sorting algorithm is faster
3 / 50
Is it possible to sort without making comparisons?
4 / 50
In simple brute-force algorithm, we give no thought to efficiency.
5 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
6 / 50
Cont sort is suitable to sort the elements in range 1 to k
7 / 50
Divide-and-conquer as breaking the problem into a small number of
8 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
9 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
10 / 50
_______________ is a graphical representation of an algorithm
11 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
12 / 50
Which may be a stable sort?
13 / 50
Quick sort is best from the perspective of Locality of reference.
14 / 50
How much time merge sort takes for an array of numbers?
15 / 50
Which may be stable sort:
16 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
17 / 50
Sorting can be in _________
18 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
19 / 50
The sieve technique works in ___________ as follows
20 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
21 / 50
What is the total time to heapify?
22 / 50
Algorithm is concerned with.......issues.
23 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
24 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
25 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
26 / 50
______________ graphical representation of algorithm.
27 / 50
In Sieve Technique we do not know which item is of interest
28 / 50
The sieve technique is a special case, where the number of sub problems is just
29 / 50
Slow sorting algorithms run in,
30 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
31 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
32 / 50
A RAM is an idealized machine with ______________ random-access memory.
33 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
34 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
35 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
36 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
37 / 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.
38 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
39 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
40 / 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
41 / 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.
42 / 50
Analysis of Selection algorithm ends up with,
43 / 50
Quick sort is
44 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
45 / 50
For the sieve technique we solve the problem,
46 / 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,
47 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
48 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
49 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
50 / 50
In ____________ we have to find rank of an element from given input.
Your score is
The average score is 40%
Restart quiz
