CS502-Midterm
1 / 50
Sieve Technique can be applied to selection problem?
2 / 50
Which may be a stable sort?
3 / 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
4 / 50
What type of instructions Random Access Machine (RAM) can execute?
5 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
6 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
7 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
8 / 50
Efficient algorithm requires less computational…….
9 / 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.
10 / 50
Quick sort is
11 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
12 / 50
In Sieve Technique we do not know which item is of interest
13 / 50
The O-notation is used to state only the asymptotic ________bounds.
14 / 50
In Quick Sort Constants hidden in T(n log n) are
15 / 50
16 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
17 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
18 / 50
In which order we can sort?
19 / 50
Slow sorting algorithms run in,
20 / 50
For the sieve technique we solve the problem,
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
If we associate (x, y) integers pair to cars where x is the speed of the car and y is the negation of the price. High y value for a car means a ________ car.
23 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
24 / 50
In Heap Sort algorithm, if heap property is violated _________
25 / 50
When we call heapify then at each level the comparison performed takes time
26 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
27 / 50
______________ graphical representation of algorithm.
28 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
29 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
30 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
31 / 50
Due to left complete nature of binary tree, the heap can be stored in
32 / 50
One Example of in place but not stable sort is
33 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
34 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
35 / 50
Cont sort is suitable to sort the elements in range 1 to k
36 / 50
37 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
38 / 50
For the Sieve Technique we take time
39 / 50
40 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
41 / 50
For the heap sort, access to nodes involves simple _______________ operations.
42 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
43 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
44 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
45 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
46 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
47 / 50
Divide-and-conquer as breaking the problem into a small number of
48 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
49 / 50
The sieve technique is a special case, where the number of sub problems is just
50 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
Your score is
The average score is 40%
Restart quiz
