CS502-Midterm
1 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
2 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
3 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
4 / 50
_______________ is a graphical representation of an algorithm
5 / 50
Which may be a stable sort?
6 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
7 / 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.
8 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
9 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
10 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
11 / 50
The Knapsack problem belongs to the domain of _______________ problems.
12 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
13 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
14 / 50
For the heap sort, access to nodes involves simple _______________ operations.
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
In simple brute-force algorithm, we give no thought to efficiency.
18 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
19 / 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.
20 / 50
Is it possible to sort without making comparisons?
21 / 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
22 / 50
In Sieve Technique we do not know which item is of interest
23 / 50
Slow sorting algorithms run in,
24 / 50
The sieve technique is a special case, where the number of sub problems is just
25 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
26 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
27 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
28 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
29 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
30 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
31 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
32 / 50
Algorithm is concerned with.......issues.
33 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
34 / 50
Due to left complete nature of binary tree, the heap can be stored in
35 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
36 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
37 / 50
Divide-and-conquer as breaking the problem into a small number of
38 / 50
One Example of in place but not stable sort is
39 / 50
For the Sieve Technique we take time
40 / 50
Random access machine or RAM is a/an
41 / 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,
42 / 50
Cont sort is suitable to sort the elements in range 1 to k
43 / 50
Which sorting algorithm is faster
44 / 50
What is the total time to heapify?
45 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
46 / 50
Sorting can be in _________
47 / 50
Analysis of Selection algorithm ends up with,
48 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
49 / 50
Quick sort is best from the perspective of Locality of reference.
50 / 50
Your score is
The average score is 40%
Restart quiz
