CS502-Midterm
1 / 50
Sorting can be in _________
2 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
3 / 50
One Example of in place but not stable sort is
4 / 50
Which may be a stable sort?
5 / 50
The O-notation is used to state only the asymptotic ________bounds.
6 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
7 / 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,
8 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
9 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
10 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
11 / 50
Analysis of Selection algorithm ends up with,
12 / 50
In RAM model instructions are executed
13 / 50
Random access machine or RAM is a/an
14 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
15 / 50
For the heap sort, access to nodes involves simple _______________ operations.
16 / 50
For the heap sort we store the tree nodes in
17 / 50
Is it possible to sort without making comparisons?
18 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
19 / 50
For the sieve technique we solve the problem,
20 / 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.
21 / 50
Quick sort is best from the perspective of Locality of reference.
22 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
23 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
24 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
25 / 50
______________ graphical representation of algorithm.
26 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
27 / 50
One example of in place but not stable algorithm is
28 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
29 / 50
A RAM is an idealized machine with ______________ random-access memory.
30 / 50
Sieve Technique can be applied to selection problem?
31 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
32 / 50
33 / 50
The sieve technique is a special case, where the number of sub problems is just
34 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
35 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
36 / 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.
37 / 50
In Quick Sort Constants hidden in T(n log n) are
38 / 50
39 / 50
In simple brute-force algorithm, we give no thought to efficiency.
40 / 50
After sorting in merge sort algorithm, merging process is invoked.
41 / 50
In ____________ we have to find rank of an element from given input.
42 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
43 / 50
In which order we can sort?
44 / 50
When we call heapify then at each level the comparison performed takes time
45 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
46 / 50
What is the total time to heapify?
47 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
48 / 50
The number of nodes in a complete binary tree of height h is
49 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
50 / 50
Which sorting algorithm is faster
Your score is
The average score is 40%
Restart quiz
