CS502-Midterm
1 / 50
In Sieve Technique we do not know which item is of interest
2 / 50
After sorting in merge sort algorithm, merging process is invoked.
3 / 50
Due to left complete nature of binary tree, the heap can be stored in
4 / 50
Which may be stable sort:
5 / 50
A heap is a left-complete binary tree that conforms to the ___________
6 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
7 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
8 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
9 / 50
Random access machine or RAM is a/an
10 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
11 / 50
_______________ is a graphical representation of an algorithm
12 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
13 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
14 / 50
In which order we can sort?
15 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
16 / 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.
17 / 50
The number of nodes in a complete binary tree of height h is
18 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
19 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
20 / 50
Cont sort is suitable to sort the elements in range 1 to k
21 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
22 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
23 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
24 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
25 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
26 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
27 / 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.
28 / 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
29 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
30 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
31 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
32 / 50
When we call heapify then at each level the comparison performed takes time
33 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
34 / 50
For the Sieve Technique we take time
35 / 50
In ____________ we have to find rank of an element from given input.
36 / 50
Sorting can be in _________
37 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
38 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
39 / 50
For the heap sort we store the tree nodes in
40 / 50
Slow sorting algorithms run in,
41 / 50
In the analysis of Selection algorithm, we eliminate a constant fraction of the array with each phase; we get the convergent _______________ series in the analysis,
42 / 50
The running time of quick sort depends heavily on the selection of
43 / 50
In simple brute-force algorithm, we give no thought to efficiency.
44 / 50
The O-notation is used to state only the asymptotic ________bounds.
45 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
46 / 50
The sieve technique is a special case, where the number of sub problems is just
47 / 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.
48 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
49 / 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.
50 / 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.
Your score is
The average score is 40%
Restart quiz
