CS502-Midterm
1 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
2 / 50
Which may be a stable sort?
3 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
4 / 50
One example of in place but not stable algorithm is
5 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
6 / 50
What type of instructions Random Access Machine (RAM) can execute?
7 / 50
In Heap Sort algorithm, if heap property is violated _________
8 / 50
After sorting in merge sort algorithm, merging process is invoked.
9 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
10 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
11 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
12 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
13 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
14 / 50
_______________ is a graphical representation of an algorithm
15 / 50
Sorting can be in _________
16 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
17 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
18 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
19 / 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,
20 / 50
What is the total time to heapify?
21 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
22 / 50
In Quick Sort Constants hidden in T(n log n) are
23 / 50
The number of nodes in a complete binary tree of height h is
24 / 50
For the heap sort, access to nodes involves simple _______________ operations.
25 / 50
When we call heapify then at each level the comparison performed takes time
26 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
27 / 50
In RAM model instructions are executed
28 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
29 / 50
Counting sort has time complexity:
30 / 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.
31 / 50
For the heap sort we store the tree nodes in
32 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
33 / 50
______________ graphical representation of algorithm.
34 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
35 / 50
The O-notation is used to state only the asymptotic ________bounds.
36 / 50
A RAM is an idealized machine with ______________ random-access memory.
37 / 50
The Knapsack problem belongs to the domain of _______________ problems.
38 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
39 / 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.
40 / 50
Due to left complete nature of binary tree, the heap can be stored in
41 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
42 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
43 / 50
44 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
45 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
46 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
47 / 50
The sieve technique works in ___________ as follows
48 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
49 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
50 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
Your score is
The average score is 40%
Restart quiz
