CS502-Midterm
1 / 50
The running time of quick sort depends heavily on the selection of
2 / 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,
3 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
4 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
5 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
6 / 50
In Sieve Technique we do not know which item is of interest
7 / 50
______________ graphical representation of algorithm.
8 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
9 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
10 / 50
Which may be a stable sort?
11 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
12 / 50
The O-notation is used to state only the asymptotic ________bounds.
13 / 50
In which order we can sort?
14 / 50
The Knapsack problem belongs to the domain of _______________ problems.
15 / 50
Which sorting algorithm is faster
16 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
17 / 50
For the sieve technique we solve the problem,
18 / 50
What is the total time to heapify?
19 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
20 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
21 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
22 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
23 / 50
24 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
25 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
26 / 50
In Heap Sort algorithm, if heap property is violated _________
27 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
28 / 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.
29 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
30 / 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.
31 / 50
Sieve Technique can be applied to selection problem?
32 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
33 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
34 / 50
Counting sort has time complexity:
35 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
36 / 50
The sieve technique works in ___________ as follows
37 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
38 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
39 / 50
The sieve technique is a special case, where the number of sub problems is just
40 / 50
Quick sort is
41 / 50
For the heap sort we store the tree nodes in
42 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
43 / 50
Which may be stable sort:
44 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
45 / 50
46 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
47 / 50
In simple brute-force algorithm, we give no thought to efficiency.
48 / 50
How much time merge sort takes for an array of numbers?
49 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
50 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
Your score is
The average score is 40%
Restart quiz
