CS502-Midterm
1 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
2 / 50
Sorting can be in _________
3 / 50
A RAM is an idealized machine with ______________ random-access memory.
4 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
5 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
6 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
7 / 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.
8 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
9 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
10 / 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.
11 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
12 / 50
Sieve Technique can be applied to selection problem?
13 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
14 / 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.
15 / 50
One example of in place but not stable algorithm is
16 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
17 / 50
In which order we can sort?
18 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
19 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
20 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
21 / 50
In Heap Sort algorithm, if heap property is violated _________
22 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
23 / 50
How much time merge sort takes for an array of numbers?
24 / 50
In Sieve Technique we do not know which item is of interest
25 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
26 / 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
27 / 50
When we call heapify then at each level the comparison performed takes time
28 / 50
Is it possible to sort without making comparisons?
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
The sieve technique is a special case, where the number of sub problems is just
31 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
32 / 50
33 / 50
For the sieve technique we solve the problem,
34 / 50
For the heap sort, access to nodes involves simple _______________ operations.
35 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
36 / 50
_______________ is a graphical representation of an algorithm
37 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
38 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
39 / 50
Which may be a stable sort?
40 / 50
The number of nodes in a complete binary tree of height h is
41 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
42 / 50
Due to left complete nature of binary tree, the heap can be stored in
43 / 50
Which may be stable sort:
44 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
45 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
46 / 50
What is the total time to heapify?
47 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
48 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
49 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
50 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
Your score is
The average score is 40%
Restart quiz
