CS502-Midterm
1 / 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,
2 / 50
One example of in place but not stable algorithm is
3 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
4 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
5 / 50
How much time merge sort takes for an array of numbers?
6 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
7 / 50
Counting sort has time complexity:
8 / 50
Quick sort is
9 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
10 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
11 / 50
Analysis of Selection algorithm ends up with,
12 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
13 / 50
Efficient algorithm requires less computational…….
14 / 50
Sieve Technique can be applied to selection problem?
15 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
16 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
17 / 50
What is the total time to heapify?
18 / 50
Which sorting algorithm is faster
19 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
20 / 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.
21 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
22 / 50
Which may be a stable sort?
23 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
24 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
25 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
26 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
27 / 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.
28 / 50
Random access machine or RAM is a/an
29 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
30 / 50
The number of nodes in a complete binary tree of height h is
31 / 50
In Quick Sort Constants hidden in T(n log n) are
32 / 50
In Sieve Technique we do not know which item is of interest
33 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
34 / 50
A heap is a left-complete binary tree that conforms to the ___________
35 / 50
For the Sieve Technique we take time
36 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
37 / 50
In RAM model instructions are executed
38 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
39 / 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.
40 / 50
What type of instructions Random Access Machine (RAM) can execute?
41 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
42 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
43 / 50
Cont sort is suitable to sort the elements in range 1 to k
44 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
45 / 50
46 / 50
In ____________ we have to find rank of an element from given input.
47 / 50
A RAM is an idealized machine with ______________ random-access memory.
48 / 50
49 / 50
______________ graphical representation of algorithm.
50 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
Your score is
The average score is 40%
Restart quiz
