CS502-Midterm
1 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
2 / 50
The sieve technique is a special case, where the number of sub problems is just
3 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
4 / 50
Sieve Technique can be applied to selection problem?
5 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
6 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
7 / 50
After sorting in merge sort algorithm, merging process is invoked.
8 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
9 / 50
44.The running time of an algorithm would not depend upon the optimization by the compiler but that of an implementation of the algorithm would depend on it.
10 / 50
In Sieve Technique we do not know which item is of interest
11 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
12 / 50
In RAM model instructions are executed
13 / 50
In Quick Sort Constants hidden in T(n log n) are
14 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
15 / 50
For the sieve technique we solve the problem,
16 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
17 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
18 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
19 / 50
Divide-and-conquer as breaking the problem into a small number of
20 / 50
Counting sort has time complexity:
21 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
22 / 50
The function f(n)=n(logn+1)/2 is asymptotically equivalent to nlog n. Here Lower Bound means function f(n) grows asymptotically at ____________ as fast as nlog n.
23 / 50
Is it possible to sort without making comparisons?
24 / 50
Due to left complete nature of binary tree, the heap can be stored in
25 / 50
When we call heapify then at each level the comparison performed takes time
26 / 50
What is the total time to heapify?
27 / 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.
28 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
29 / 50
What type of instructions Random Access Machine (RAM) can execute?
30 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
31 / 50
32 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
33 / 50
In which order we can sort?
34 / 50
Which sorting algorithm is faster
35 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
36 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
37 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
38 / 50
In simple brute-force algorithm, we give no thought to efficiency.
39 / 50
Which may be stable sort:
40 / 50
Analysis of Selection algorithm ends up with,
41 / 50
One Example of in place but not stable sort is
42 / 50
43 / 50
Algorithm is concerned with.......issues.
44 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
45 / 50
Cont sort is suitable to sort the elements in range 1 to k
46 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
47 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
48 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
49 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
50 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
Your score is
The average score is 40%
Restart quiz
