CS502-Midterm
1 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
2 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
3 / 50
In Heap Sort algorithm, if heap property is violated _________
4 / 50
Which may be stable sort:
5 / 50
In Sieve Technique we do not know which item is of interest
6 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
7 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
8 / 50
For the heap sort we store the tree nodes in
9 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
10 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
11 / 50
Divide-and-conquer as breaking the problem into a small number of
12 / 50
Slow sorting algorithms run in,
13 / 50
Which sorting algorithm is faster
14 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
15 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
16 / 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.
17 / 50
What is the total time to heapify?
18 / 50
Is it possible to sort without making comparisons?
19 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
20 / 50
For the sieve technique we solve the problem,
21 / 50
Random access machine or RAM is a/an
22 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
23 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
24 / 50
25 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
26 / 50
Sieve Technique can be applied to selection problem?
27 / 50
______________ graphical representation of algorithm.
28 / 50
Quick sort is
29 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
30 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
31 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
32 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
33 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
34 / 50
Cont sort is suitable to sort the elements in range 1 to k
35 / 50
36 / 50
44.The running time of an algorithm would not depend upon the optimization by the compiler but that of an implementation of the algorithm would depend on it.
37 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
38 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
39 / 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.
40 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
41 / 50
The running time of quick sort depends heavily on the selection of
42 / 50
Due to left complete nature of binary tree, the heap can be stored in
43 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
44 / 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.
45 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
46 / 50
The sieve technique works in ___________ as follows
47 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
48 / 50
_______________ is a graphical representation of an algorithm
49 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
50 / 50
The sieve technique is a special case, where the number of sub problems is just
Your score is
The average score is 40%
Restart quiz
