CS502-Midterm
1 / 50
Algorithm is concerned with.......issues.
2 / 50
How much time merge sort takes for an array of numbers?
3 / 50
Sieve Technique can be applied to selection problem?
4 / 50
Which may be a stable sort?
5 / 50
For the sieve technique we solve the problem,
6 / 50
In ____________ we have to find rank of an element from given input.
7 / 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.
8 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
9 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
10 / 50
In simple brute-force algorithm, we give no thought to efficiency.
11 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
12 / 50
Consider the following code:
For(j=1; j
For(k=1; k<15;k++)
For(l=5; l
{
Do_something_constant();
}
What is the order of execution for this code.
13 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
14 / 50
In Quick Sort Constants hidden in T(n log n) are
15 / 50
Is it possible to sort without making comparisons?
16 / 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,
17 / 50
A RAM is an idealized machine with ______________ random-access memory.
18 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
19 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
20 / 50
Quick sort is best from the perspective of Locality of reference.
21 / 50
For the heap sort we store the tree nodes in
22 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
23 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
24 / 50
Sorting can be in _________
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
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.
27 / 50
Slow sorting algorithms run in,
28 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
29 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
30 / 50
Random access machine or RAM is a/an
31 / 50
For the Sieve Technique we take time
32 / 50
The O-notation is used to state only the asymptotic ________bounds.
33 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
34 / 50
The number of nodes in a complete binary tree of height h is
35 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
36 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
37 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
38 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
39 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
40 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
41 / 50
In Sieve Technique we do not know which item is of interest
42 / 50
For the heap sort, access to nodes involves simple _______________ operations.
43 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
44 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
45 / 50
Which sorting algorithm is faster
46 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
47 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
48 / 50
What is the total time to heapify?
49 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
50 / 50
One example of in place but not stable algorithm is
Your score is
The average score is 40%
Restart quiz
