CS502-Midterm
1 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
2 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
3 / 50
Algorithm is concerned with.......issues.
4 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
5 / 50
In which order we can sort?
6 / 50
The Knapsack problem belongs to the domain of _______________ problems.
7 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
8 / 50
Analysis of Selection algorithm ends up with,
9 / 50
For the heap sort we store the tree nodes in
10 / 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.
11 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
12 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
13 / 50
Divide-and-conquer as breaking the problem into a small number of
14 / 50
In Quick Sort Constants hidden in T(n log n) are
15 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
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
In RAM model instructions are executed
18 / 50
For the Sieve Technique we take time
19 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
20 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
21 / 50
In Sieve Technique we do not know which item is of interest
22 / 50
Which may be stable sort:
23 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
24 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
25 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
26 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
27 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
28 / 50
The number of nodes in a complete binary tree of height h is
29 / 50
30 / 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.
31 / 50
Slow sorting algorithms run in,
32 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
33 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
34 / 50
After sorting in merge sort algorithm, merging process is invoked.
35 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
36 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
37 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
38 / 50
39 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
40 / 50
How much time merge sort takes for an array of numbers?
41 / 50
The O-notation is used to state only the asymptotic ________bounds.
42 / 50
Which sorting algorithm is faster
43 / 50
44 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
45 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
46 / 50
Random access machine or RAM is a/an
47 / 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
48 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
49 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
50 / 50
______________ graphical representation of algorithm.
Your score is
The average score is 40%
Restart quiz
