CS502-Midterm
1 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
2 / 50
Which sorting algorithm is faster
3 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
4 / 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.
5 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
6 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
7 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
8 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
9 / 50
Quick sort is best from the perspective of Locality of reference.
10 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
11 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
12 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
13 / 50
The running time of quick sort depends heavily on the selection of
14 / 50
The sieve technique is a special case, where the number of sub problems is just
15 / 50
Sorting can be in _________
16 / 50
One example of in place but not stable algorithm is
17 / 50
In simple brute-force algorithm, we give no thought to efficiency.
18 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
19 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
20 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
21 / 50
Efficient algorithm requires less computational…….
22 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
23 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
24 / 50
A heap is a left-complete binary tree that conforms to the ___________
25 / 50
Random access machine or RAM is a/an
26 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
27 / 50
In Quick Sort Constants hidden in T(n log n) are
28 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
29 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
30 / 50
After sorting in merge sort algorithm, merging process is invoked.
31 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
32 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
33 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
34 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
35 / 50
Divide-and-conquer as breaking the problem into a small number of
36 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
37 / 50
Is it possible to sort without making comparisons?
38 / 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.
39 / 50
In which order we can sort?
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
43 / 50
What is the total time to heapify?
44 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
45 / 50
In ____________ we have to find rank of an element from given input.
46 / 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.
47 / 50
For the Sieve Technique we take time
48 / 50
How much time merge sort takes for an array of numbers?
49 / 50
50 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
Your score is
The average score is 40%
Restart quiz
