CS502-Midterm
1 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
2 / 50
Slow sorting algorithms run in,
3 / 50
Due to left complete nature of binary tree, the heap can be stored in
4 / 50
In Quick Sort Constants hidden in T(n log n) are
5 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
6 / 50
Quick sort is best from the perspective of Locality of reference.
7 / 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
8 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
9 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
10 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
11 / 50
What is the total time to heapify?
12 / 50
13 / 50
In Sieve Technique we do not know which item is of interest
14 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
15 / 50
Which sorting algorithm is faster
16 / 50
The running time of quick sort depends heavily on the selection of
17 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
18 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
19 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
20 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
21 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
22 / 50
The number of nodes in a complete binary tree of height h is
23 / 50
Divide-and-conquer as breaking the problem into a small number of
24 / 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.
25 / 50
Algorithm is concerned with.......issues.
26 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
27 / 50
A RAM is an idealized machine with ______________ random-access memory.
28 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
29 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
30 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
31 / 50
_______________ is a graphical representation of an algorithm
32 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
33 / 50
34 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
35 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
36 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
37 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
38 / 50
Analysis of Selection algorithm ends up with,
39 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
40 / 50
In RAM model instructions are executed
41 / 50
For the heap sort we store the tree nodes in
42 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
43 / 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.
44 / 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.
45 / 50
46 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
47 / 50
One example of in place but not stable algorithm is
48 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
49 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
50 / 50
Sorting can be in _________
Your score is
The average score is 40%
Restart quiz
