CS502-Midterm
1 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
2 / 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.
3 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
4 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
5 / 50
Divide-and-conquer as breaking the problem into a small number of
6 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
7 / 50
In which order we can sort?
8 / 50
For the Sieve Technique we take time
9 / 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
10 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
11 / 50
In Sieve Technique we do not know which item is of interest
12 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
13 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
14 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
15 / 50
What type of instructions Random Access Machine (RAM) can execute?
16 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
17 / 50
In Heap Sort algorithm, if heap property is violated _________
18 / 50
The sieve technique works in ___________ as follows
19 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
20 / 50
Which may be stable sort:
21 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
22 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
23 / 50
_______________ is a graphical representation of an algorithm
24 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
25 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
26 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
27 / 50
Cont sort is suitable to sort the elements in range 1 to k
28 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
29 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
30 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
31 / 50
Quick sort is best from the perspective of Locality of reference.
32 / 50
For the heap sort we store the tree nodes in
33 / 50
Due to left complete nature of binary tree, the heap can be stored in
34 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
35 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
36 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
37 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
38 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
39 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
40 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
41 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
42 / 50
In ____________ we have to find rank of an element from given input.
43 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
44 / 50
One Example of in place but not stable sort is
45 / 50
The sieve technique is a special case, where the number of sub problems is just
46 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
47 / 50
48 / 50
The number of nodes in a complete binary tree of height h is
49 / 50
Sorting can be in _________
50 / 50
Efficient algorithm requires less computational…….
Your score is
The average score is 40%
Restart quiz
