CS502-Midterm
1 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
2 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
3 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
4 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
5 / 50
Efficient algorithm requires less computational…….
6 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
7 / 50
For the heap sort we store the tree nodes in
8 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
9 / 50
One Example of in place but not stable sort is
10 / 50
One example of in place but not stable algorithm is
11 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
12 / 50
In Quick Sort Constants hidden in T(n log n) are
13 / 50
In Sieve Technique we do not know which item is of interest
14 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
15 / 50
The running time of quick sort depends heavily on the selection of
16 / 50
Divide-and-conquer as breaking the problem into a small number of
17 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
18 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
19 / 50
What is the total time to heapify?
20 / 50
Algorithm is concerned with.......issues.
21 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
22 / 50
The sieve technique is a special case, where the number of sub problems is just
23 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
24 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
25 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
26 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
27 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
28 / 50
In Heap Sort algorithm, if heap property is violated _________
29 / 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,
30 / 50
For the sieve technique we solve the problem,
31 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
32 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
33 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
34 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
35 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
36 / 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.
37 / 50
The number of nodes in a complete binary tree of height h is
38 / 50
The Knapsack problem belongs to the domain of _______________ problems.
39 / 50
40 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
41 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
42 / 50
_______________ is a graphical representation of an algorithm
43 / 50
For the heap sort, access to nodes involves simple _______________ operations.
44 / 50
Consider the following code:
For(j=1; j
For(k=1; k<15;k++)
For(l=5; l
{
Do_something_constant();
}
What is the order of execution for this code.
45 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
46 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
47 / 50
48 / 50
49 / 50
What type of instructions Random Access Machine (RAM) can execute?
50 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
Your score is
The average score is 40%
Restart quiz
