CS502-Midterm
1 / 50
The sieve technique works in ___________ as follows
2 / 50
_______________ is a graphical representation of an algorithm
3 / 50
A heap is a left-complete binary tree that conforms to the ___________
4 / 50
Random access machine or RAM is a/an
5 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
6 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
7 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
8 / 50
One example of in place but not stable algorithm is
9 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
10 / 50
A RAM is an idealized machine with ______________ random-access memory.
11 / 50
What is the total time to heapify?
12 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
13 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
14 / 50
The sieve technique is a special case, where the number of sub problems is just
15 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
16 / 50
Is it possible to sort without making comparisons?
17 / 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.
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 which order we can sort?
20 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
21 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
22 / 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.
23 / 50
In RAM model instructions are executed
24 / 50
For the Sieve Technique we take time
25 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
26 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
27 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
28 / 50
The running time of quick sort depends heavily on the selection of
29 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
30 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
31 / 50
The O-notation is used to state only the asymptotic ________bounds.
32 / 50
Due to left complete nature of binary tree, the heap can be stored in
33 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
34 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
35 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
36 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
37 / 50
For the heap sort we store the tree nodes in
38 / 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.
39 / 50
In Quick Sort Constants hidden in T(n log n) are
40 / 50
Quick sort is best from the perspective of Locality of reference.
41 / 50
The number of nodes in a complete binary tree of height h is
42 / 50
Slow sorting algorithms run in,
43 / 50
What type of instructions Random Access Machine (RAM) can execute?
44 / 50
The function f(n)=n(logn+1)/2 is asymptotically equivalent to nlog n. Here Lower Bound means function f(n) grows asymptotically at ____________ as fast as nlog n.
45 / 50
Which sorting algorithm is faster
46 / 50
47 / 50
Sorting can be in _________
48 / 50
Quick sort is
49 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
50 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
Your score is
The average score is 40%
Restart quiz
