CS502-Midterm
1 / 50
Sorting can be in _________
2 / 50
In Sieve Technique we do not know which item is of interest
3 / 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.
4 / 50
The number of nodes in a complete binary tree of height h is
5 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
6 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
7 / 50
Algorithm is concerned with.......issues.
8 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
9 / 50
For the Sieve Technique we take time
10 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
11 / 50
A RAM is an idealized machine with ______________ random-access memory.
12 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
13 / 50
Sieve Technique can be applied to selection problem?
14 / 50
After sorting in merge sort algorithm, merging process is invoked.
15 / 50
Analysis of Selection algorithm ends up with,
16 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
17 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
18 / 50
In Heap Sort algorithm, if heap property is violated _________
19 / 50
Divide-and-conquer as breaking the problem into a small number of
20 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
21 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
22 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
23 / 50
The sieve technique is a special case, where the number of sub problems is just
24 / 50
In Quick Sort Constants hidden in T(n log n) are
25 / 50
The running time of quick sort depends heavily on the selection of
26 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
27 / 50
In which order we can sort?
28 / 50
Which may be a stable sort?
29 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
30 / 50
The O-notation is used to state only the asymptotic ________bounds.
31 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
32 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
33 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
34 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
35 / 50
Upper bound requires that there exist positive constants c2 and n0 such that f(n) ____ c2n for all n <= n0(ye question ghalat lag raha hai mujhae
36 / 50
One example of in place but not stable algorithm is
37 / 50
Counting sort has time complexity:
38 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
39 / 50
What type of instructions Random Access Machine (RAM) can execute?
40 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
41 / 50
The Knapsack problem belongs to the domain of _______________ problems.
42 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
43 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
44 / 50
Cont sort is suitable to sort the elements in range 1 to k
45 / 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.
46 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
47 / 50
_______________ is a graphical representation of an algorithm
48 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
49 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
50 / 50
______________ graphical representation of algorithm.
Your score is
The average score is 40%
Restart quiz
