CS502-Midterm
1 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
2 / 50
What type of instructions Random Access Machine (RAM) can execute?
3 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
4 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
5 / 50
In Sieve Technique we do not know which item is of interest
6 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
7 / 50
Algorithm is concerned with.......issues.
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
For the sieve technique we solve the problem,
10 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
11 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
12 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
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
Analysis of Selection algorithm ends up with,
15 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
16 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
17 / 50
Which may be a stable sort?
18 / 50
In Heap Sort algorithm, if heap property is violated _________
19 / 50
Cont sort is suitable to sort the elements in range 1 to k
20 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
21 / 50
Which may be stable sort:
22 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
23 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
24 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
25 / 50
Divide-and-conquer as breaking the problem into a small number of
26 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
27 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
28 / 50
In Quick Sort Constants hidden in T(n log n) are
29 / 50
The number of nodes in a complete binary tree of height h is
30 / 50
For the heap sort, access to nodes involves simple _______________ operations.
31 / 50
The running time of quick sort depends heavily on the selection of
32 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
33 / 50
34 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
35 / 50
The sieve technique works in ___________ as follows
36 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
37 / 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.
38 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
39 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
40 / 50
For the Sieve Technique we take time
41 / 50
The O-notation is used to state only the asymptotic ________bounds.
42 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
43 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
44 / 50
In which order we can sort?
45 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
46 / 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.
47 / 50
The sieve technique is a special case, where the number of sub problems is just
48 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
49 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
50 / 50
After sorting in merge sort algorithm, merging process is invoked.
Your score is
The average score is 40%
Restart quiz
