CS502-Midterm
1 / 50
In which order we can sort?
2 / 50
One Example of in place but not stable sort is
3 / 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.
4 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
5 / 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.
6 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
7 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
8 / 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.
9 / 50
Is it possible to sort without making comparisons?
10 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
11 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
12 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
13 / 50
In Sieve Technique we do not know which item is of interest
14 / 50
The O-notation is used to state only the asymptotic ________bounds.
15 / 50
What is the total time to heapify?
16 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
17 / 50
18 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
19 / 50
How much time merge sort takes for an array of numbers?
20 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
21 / 50
In simple brute-force algorithm, we give no thought to efficiency.
22 / 50
Divide-and-conquer as breaking the problem into a small number of
23 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
24 / 50
Sieve Technique can be applied to selection problem?
25 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
26 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
27 / 50
For the worst-case running time analysis, the nested loop structure containing one “for” and one “while” loop, might be expressed as a pair of _________nested summations.
28 / 50
What type of instructions Random Access Machine (RAM) can execute?
29 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
30 / 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.
31 / 50
Sorting can be in _________
32 / 50
When we call heapify then at each level the comparison performed takes time
33 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
34 / 50
Cont sort is suitable to sort the elements in range 1 to k
35 / 50
36 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
37 / 50
38 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
39 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
40 / 50
Algorithm is concerned with.......issues.
41 / 50
In ____________ we have to find rank of an element from given input.
42 / 50
For the heap sort, access to nodes involves simple _______________ operations.
43 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
44 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
45 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
46 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
47 / 50
Which sorting algorithm is faster
48 / 50
The Knapsack problem belongs to the domain of _______________ problems.
49 / 50
The sieve technique is a special case, where the number of sub problems is just
50 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
Your score is
The average score is 40%
Restart quiz
