CS502-Midterm
1 / 50
In ____________ we have to find rank of an element from given input.
2 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
3 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
4 / 50
The number of nodes in a complete binary tree of height h is
5 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
6 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
7 / 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.
8 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
9 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
10 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
11 / 50
In Quick Sort Constants hidden in T(n log n) are
12 / 50
The running time of quick sort depends heavily on the selection of
13 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
14 / 50
In Heap Sort algorithm, if heap property is violated _________
15 / 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.
16 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
17 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
18 / 50
What is the total time to heapify?
19 / 50
The Knapsack problem belongs to the domain of _______________ problems.
20 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
21 / 50
_______________ is a graphical representation of an algorithm
22 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
23 / 50
24 / 50
Due to left complete nature of binary tree, the heap can be stored in
25 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
26 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
27 / 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,
28 / 50
After sorting in merge sort algorithm, merging process is invoked.
29 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
30 / 50
One example of in place but not stable algorithm is
31 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
32 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
33 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
34 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
35 / 50
Algorithm is concerned with.......issues.
36 / 50
Quick sort is best from the perspective of Locality of reference.
37 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
38 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
39 / 50
Sieve Technique can be applied to selection problem?
40 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
41 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
42 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
43 / 50
44 / 50
In which order we can sort?
45 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
46 / 50
A RAM is an idealized machine with ______________ random-access memory.
47 / 50
Random access machine or RAM is a/an
48 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
49 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
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
