CS502-Midterm
1 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
2 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
3 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
4 / 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.
5 / 50
Which sorting algorithm is faster
6 / 50
How much time merge sort takes for an array of numbers?
7 / 50
In Heap Sort algorithm, if heap property is violated _________
8 / 50
One example of in place but not stable algorithm is
9 / 50
In Quick Sort Constants hidden in T(n log n) are
10 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
11 / 50
Quick sort is best from the perspective of Locality of reference.
12 / 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.
13 / 50
Slow sorting algorithms run in,
14 / 50
For the heap sort we store the tree nodes in
15 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
16 / 50
Which may be stable sort:
17 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
18 / 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,
19 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
20 / 50
_______________ is a graphical representation of an algorithm
21 / 50
Sieve Technique can be applied to selection problem?
22 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
23 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
24 / 50
The number of nodes in a complete binary tree of height h is
25 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
26 / 50
Analysis of Selection algorithm ends up with,
27 / 50
For the Sieve Technique we take time
28 / 50
For the sieve technique we solve the problem,
29 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
30 / 50
A RAM is an idealized machine with ______________ random-access memory.
31 / 50
What is the total time to heapify?
32 / 50
33 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
34 / 50
In simple brute-force algorithm, we give no thought to efficiency.
35 / 50
What type of instructions Random Access Machine (RAM) can execute?
36 / 50
After sorting in merge sort algorithm, merging process is invoked.
37 / 50
38 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
39 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
40 / 50
Sorting can be in _________
41 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
42 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
43 / 50
In ____________ we have to find rank of an element from given input.
44 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
45 / 50
Cont sort is suitable to sort the elements in range 1 to k
46 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
47 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
48 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
49 / 50
The O-notation is used to state only the asymptotic ________bounds.
50 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
Your score is
The average score is 40%
Restart quiz
