CS502-Midterm
1 / 50
______________ graphical representation of algorithm.
2 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
3 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
4 / 50
After sorting in merge sort algorithm, merging process is invoked.
5 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
6 / 50
When we call heapify then at each level the comparison performed takes time
7 / 50
In Quick Sort Constants hidden in T(n log n) are
8 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
9 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
10 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
11 / 50
A heap is a left-complete binary tree that conforms to the ___________
12 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
13 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
14 / 50
Due to left complete nature of binary tree, the heap can be stored in
15 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
16 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
17 / 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.
18 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
19 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
20 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
21 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
22 / 50
Quick sort is
23 / 50
How much time merge sort takes for an array of numbers?
24 / 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,
25 / 50
Algorithm is concerned with.......issues.
26 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
27 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
28 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
29 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
30 / 50
One Example of in place but not stable sort is
31 / 50
Sieve Technique can be applied to selection problem?
32 / 50
The sieve technique is a special case, where the number of sub problems is just
33 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
34 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
35 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
36 / 50
For the Sieve Technique we take time
37 / 50
Sorting can be in _________
38 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
39 / 50
40 / 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.
41 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
42 / 50
Slow sorting algorithms run in,
43 / 50
Which may be stable sort:
44 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
45 / 50
What is the total time to heapify?
46 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
47 / 50
48 / 50
A RAM is an idealized machine with ______________ random-access memory.
49 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
50 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
Your score is
The average score is 40%
Restart quiz
