CS502-Midterm
1 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
2 / 50
For the Sieve Technique we take time
3 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
4 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
5 / 50
Random access machine or RAM is a/an
6 / 50
Is it possible to sort without making comparisons?
7 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
8 / 50
The running time of quick sort depends heavily on the selection of
9 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
10 / 50
A RAM is an idealized machine with ______________ random-access memory.
11 / 50
In Quick Sort Constants hidden in T(n log n) are
12 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
13 / 50
Quick sort is best from the perspective of Locality of reference.
14 / 50
Slow sorting algorithms run in,
15 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
16 / 50
The Knapsack problem belongs to the domain of _______________ problems.
17 / 50
The sieve technique works in ___________ as follows
18 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
19 / 50
What type of instructions Random Access Machine (RAM) can execute?
20 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
21 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
22 / 50
Algorithm is concerned with.......issues.
23 / 50
Which may be a stable sort?
24 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
25 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
26 / 50
What is the total time to heapify?
27 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
28 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
29 / 50
In Sieve Technique we do not know which item is of interest
30 / 50
One example of in place but not stable algorithm is
31 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
32 / 50
The number of nodes in a complete binary tree of height h is
33 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
34 / 50
For the sieve technique we solve the problem,
35 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
36 / 50
Analysis of Selection algorithm ends up with,
37 / 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.
38 / 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.
39 / 50
_______________ is a graphical representation of an algorithm
40 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
41 / 50
Sieve Technique can be applied to selection problem?
42 / 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.
43 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
44 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
45 / 50
Sorting can be in _________
46 / 50
47 / 50
After sorting in merge sort algorithm, merging process is invoked.
48 / 50
49 / 50
For the heap sort, access to nodes involves simple _______________ operations.
50 / 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.
Your score is
The average score is 40%
Restart quiz
