CS502-Midterm
1 / 50
One example of in place but not stable algorithm is
2 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
3 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
4 / 50
In Heap Sort algorithm, if heap property is violated _________
5 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
6 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
7 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
8 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
9 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
10 / 50
What type of instructions Random Access Machine (RAM) can execute?
11 / 50
For the heap sort we store the tree nodes in
12 / 50
The sieve technique works in ___________ as follows
13 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
14 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
15 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
16 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
17 / 50
After sorting in merge sort algorithm, merging process is invoked.
18 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
19 / 50
Slow sorting algorithms run in,
20 / 50
In Quick Sort Constants hidden in T(n log n) are
21 / 50
In Sieve Technique we do not know which item is of interest
22 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
23 / 50
Efficient algorithm requires less computational…….
24 / 50
In which order we can sort?
25 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
26 / 50
In RAM model instructions are executed
27 / 50
For the Sieve Technique we take time
28 / 50
In simple brute-force algorithm, we give no thought to efficiency.
29 / 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.
30 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
31 / 50
_______________ is a graphical representation of an algorithm
32 / 50
The Knapsack problem belongs to the domain of _______________ problems.
33 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
34 / 50
What is the total time to heapify?
35 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
36 / 50
______________ graphical representation of algorithm.
37 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
38 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
39 / 50
Counting sort has time complexity:
40 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
41 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
42 / 50
Cont sort is suitable to sort the elements in range 1 to k
43 / 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.
44 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
45 / 50
Which may be stable sort:
46 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
47 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
48 / 50
The O-notation is used to state only the asymptotic ________bounds.
49 / 50
Sieve Technique can be applied to selection problem?
50 / 50
Which may be a stable sort?
Your score is
The average score is 40%
Restart quiz
