CS502-Midterm
1 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
2 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
3 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
4 / 50
In simple brute-force algorithm, we give no thought to efficiency.
5 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
6 / 50
The running time of quick sort depends heavily on the selection of
7 / 50
Sorting can be in _________
8 / 50
The Knapsack problem belongs to the domain of _______________ problems.
9 / 50
What type of instructions Random Access Machine (RAM) can execute?
10 / 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.
11 / 50
What is the total time to heapify?
12 / 50
In which order we can sort?
13 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
14 / 50
______________ graphical representation of algorithm.
15 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
16 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
17 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
18 / 50
Quick sort is
19 / 50
For the Sieve Technique we take time
20 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
21 / 50
Quick sort is best from the perspective of Locality of reference.
22 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
23 / 50
The O-notation is used to state only the asymptotic ________bounds.
24 / 50
In ____________ we have to find rank of an element from given input.
25 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
26 / 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.
27 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
28 / 50
A RAM is an idealized machine with ______________ random-access memory.
29 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
30 / 50
For the heap sort, access to nodes involves simple _______________ operations.
31 / 50
Random access machine or RAM is a/an
32 / 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,
33 / 50
The sieve technique works in ___________ as follows
34 / 50
The number of nodes in a complete binary tree of height h is
35 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
36 / 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.
37 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
38 / 50
Which sorting algorithm is faster
39 / 50
In Sieve Technique we do not know which item is of interest
40 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
41 / 50
42 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
43 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
44 / 50
In RAM model instructions are executed
45 / 50
Which may be a stable sort?
46 / 50
Due to left complete nature of binary tree, the heap can be stored in
47 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
48 / 50
Counting sort has time complexity:
49 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
50 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
Your score is
The average score is 40%
Restart quiz
