CS502-Midterm
1 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
2 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
3 / 50
A RAM is an idealized machine with ______________ random-access memory.
4 / 50
______________ graphical representation of algorithm.
5 / 50
Random access machine or RAM is a/an
6 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
7 / 50
Slow sorting algorithms run in,
8 / 50
One Example of in place but not stable sort is
9 / 50
In RAM model instructions are executed
10 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
11 / 50
After sorting in merge sort algorithm, merging process is invoked.
12 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
13 / 50
What type of instructions Random Access Machine (RAM) can execute?
14 / 50
A heap is a left-complete binary tree that conforms to the ___________
15 / 50
For the Sieve Technique we take time
16 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
17 / 50
Quick sort is
18 / 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.
19 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
20 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
21 / 50
In ____________ we have to find rank of an element from given input.
22 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
23 / 50
In simple brute-force algorithm, we give no thought to efficiency.
24 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
25 / 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.
26 / 50
The O-notation is used to state only the asymptotic ________bounds.
27 / 50
In Sieve Technique we do not know which item is of interest
28 / 50
The sieve technique is a special case, where the number of sub problems is just
29 / 50
For the heap sort we store the tree nodes in
30 / 50
In Heap Sort algorithm, if heap property is violated _________
31 / 50
The sieve technique works in ___________ as follows
32 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
33 / 50
How much time merge sort takes for an array of numbers?
34 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
35 / 50
Divide-and-conquer as breaking the problem into a small number of
36 / 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,
37 / 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.
38 / 50
39 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
40 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
41 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
42 / 50
For the heap sort, access to nodes involves simple _______________ operations.
43 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
44 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
45 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
46 / 50
Cont sort is suitable to sort the elements in range 1 to k
47 / 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.
48 / 50
In Quick Sort Constants hidden in T(n log n) are
49 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
50 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
Your score is
The average score is 40%
Restart quiz
