CS502-Midterm
1 / 50
What is the total time to heapify?
2 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
3 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
4 / 50
Random access machine or RAM is a/an
5 / 50
Which sorting algorithm is faster
6 / 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
7 / 50
Due to left complete nature of binary tree, the heap can be stored in
8 / 50
Algorithm is concerned with.......issues.
9 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
10 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
11 / 50
In Sieve Technique we do not know which item is of interest
12 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
13 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
14 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
15 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
16 / 50
Sorting can be in _________
17 / 50
The running time of quick sort depends heavily on the selection of
18 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
19 / 50
______________ graphical representation of algorithm.
20 / 50
For the Sieve Technique we take time
21 / 50
22 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
23 / 50
The sieve technique is a special case, where the number of sub problems is just
24 / 50
Which may be a stable sort?
25 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
26 / 50
In Heap Sort algorithm, if heap property is violated _________
27 / 50
Is it possible to sort without making comparisons?
28 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
29 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
30 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
31 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
32 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
33 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
34 / 50
35 / 50
In simple brute-force algorithm, we give no thought to efficiency.
36 / 50
37 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
38 / 50
Analysis of Selection algorithm ends up with,
39 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
40 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
41 / 50
Which may be stable sort:
42 / 50
In which order we can sort?
43 / 50
44 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
45 / 50
The O-notation is used to state only the asymptotic ________bounds.
46 / 50
The sieve technique works in ___________ as follows
47 / 50
Quick sort is
48 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
49 / 50
In Quick Sort Constants hidden in T(n log n) are
50 / 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.
Your score is
The average score is 40%
Restart quiz
