CS502-Midterm
1 / 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.
2 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
3 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
4 / 50
Algorithm is concerned with.......issues.
5 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
6 / 50
One Example of in place but not stable sort is
7 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
8 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
9 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
10 / 50
In Sieve Technique we do not know which item is of interest
11 / 50
Analysis of Selection algorithm ends up with,
12 / 50
Counting sort has time complexity:
13 / 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.
14 / 50
Due to left complete nature of binary tree, the heap can be stored in
15 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
16 / 50
What is the total time to heapify?
17 / 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,
18 / 50
The Knapsack problem belongs to the domain of _______________ problems.
19 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
20 / 50
21 / 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
22 / 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.
23 / 50
Which may be a stable sort?
24 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
25 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
26 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
27 / 50
Sieve Technique can be applied to selection problem?
28 / 50
For the Sieve Technique we take time
29 / 50
Random access machine or RAM is a/an
30 / 50
How much time merge sort takes for an array of numbers?
31 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
32 / 50
33 / 50
Sorting can be in _________
34 / 50
35 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
36 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
37 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
38 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
39 / 50
The O-notation is used to state only the asymptotic ________bounds.
40 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
41 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
42 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
43 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
44 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
45 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
46 / 50
Quick sort is
47 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
48 / 50
In simple brute-force algorithm, we give no thought to efficiency.
49 / 50
For the heap sort, access to nodes involves simple _______________ operations.
50 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
Your score is
The average score is 40%
Restart quiz
