CS502-Midterm
1 / 50
Which may be stable sort:
2 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
3 / 50
Slow sorting algorithms run in,
4 / 50
The number of nodes in a complete binary tree of height h is
5 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
6 / 50
For the Sieve Technique we take time
7 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
8 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
9 / 50
Efficient algorithm requires less computational…….
10 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
11 / 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.
12 / 50
In Heap Sort algorithm, if heap property is violated _________
13 / 50
A RAM is an idealized machine with ______________ random-access memory.
14 / 50
The sieve technique is a special case, where the number of sub problems is just
15 / 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.
16 / 50
In RAM model instructions are executed
17 / 50
Cont sort is suitable to sort the elements in range 1 to k
18 / 50
In plane sweep approach, a vertical line is swept across the 2d-plane and _______structure is used for holding the maximal points lying to the left of the sweep line.
19 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
20 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
21 / 50
In Sieve Technique we do not know which item is of interest
22 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
23 / 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
24 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
25 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
26 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
27 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
28 / 50
Which may be a stable sort?
29 / 50
30 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
31 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
32 / 50
33 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
34 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
35 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
36 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
37 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
38 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
39 / 50
One example of in place but not stable algorithm is
40 / 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.
41 / 50
When we call heapify then at each level the comparison performed takes time
42 / 50
What type of instructions Random Access Machine (RAM) can execute?
43 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
44 / 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.
45 / 50
In simple brute-force algorithm, we give no thought to efficiency.
46 / 50
Counting sort has time complexity:
47 / 50
48 / 50
______________ graphical representation of algorithm.
49 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
50 / 50
Which sorting algorithm is faster
Your score is
The average score is 40%
Restart quiz
