CS502-Midterm
1 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
2 / 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
3 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
4 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
5 / 50
The O-notation is used to state only the asymptotic ________bounds.
6 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
7 / 50
The Knapsack problem belongs to the domain of _______________ problems.
8 / 50
Cont sort is suitable to sort the elements in range 1 to k
9 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
10 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
11 / 50
The sieve technique is a special case, where the number of sub problems is just
12 / 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.
13 / 50
In plane sweep approach, a vertical line is swept across the 2d-plane and _______structure is used for holding the maximal points lying to the left of the sweep line.
14 / 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,
15 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
16 / 50
The number of nodes in a complete binary tree of height h is
17 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
18 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
19 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
20 / 50
After sorting in merge sort algorithm, merging process is invoked.
21 / 50
What is the total time to heapify?
22 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
23 / 50
In RAM model instructions are executed
24 / 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.
25 / 50
The running time of quick sort depends heavily on the selection of
26 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
27 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
28 / 50
Which may be stable sort:
29 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
30 / 50
In Quick Sort Constants hidden in T(n log n) are
31 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
32 / 50
One example of in place but not stable algorithm is
33 / 50
In which order we can sort?
34 / 50
Quick sort is
35 / 50
In ____________ we have to find rank of an element from given input.
36 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
37 / 50
A heap is a left-complete binary tree that conforms to the ___________
38 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
39 / 50
For the Sieve Technique we take time
40 / 50
In Sieve Technique we do not know which item is of interest
41 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
42 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
43 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
44 / 50
45 / 50
Is it possible to sort without making comparisons?
46 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
47 / 50
When we call heapify then at each level the comparison performed takes time
48 / 50
Divide-and-conquer as breaking the problem into a small number of
49 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
50 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
Your score is
The average score is 40%
Restart quiz
