CS502-Midterm
1 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
2 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
3 / 50
The sieve technique works in ___________ as follows
4 / 50
For the heap sort, access to nodes involves simple _______________ operations.
5 / 50
Quick sort is best from the perspective of Locality of reference.
6 / 50
A RAM is an idealized machine with ______________ random-access memory.
7 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
8 / 50
What is the total time to heapify?
9 / 50
10 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
11 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
12 / 50
In Sieve Technique we do not know which item is of interest
13 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
14 / 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.
15 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
16 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
17 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
18 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
19 / 50
The O-notation is used to state only the asymptotic ________bounds.
20 / 50
One example of in place but not stable algorithm is
21 / 50
Cont sort is suitable to sort the elements in range 1 to k
22 / 50
For the Sieve Technique we take time
23 / 50
In Quick Sort Constants hidden in T(n log n) are
24 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
25 / 50
What type of instructions Random Access Machine (RAM) can execute?
26 / 50
27 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
28 / 50
Sieve Technique can be applied to selection problem?
29 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
30 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
31 / 50
Which may be a stable sort?
32 / 50
Which sorting algorithm is faster
33 / 50
Quick sort is
34 / 50
35 / 50
36 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
37 / 50
For the sieve technique we solve the problem,
38 / 50
Divide-and-conquer as breaking the problem into a small number of
39 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
40 / 50
41 / 50
In RAM model instructions are executed
42 / 50
_______________ is a graphical representation of an algorithm
43 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
44 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
45 / 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.
46 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
47 / 50
In simple brute-force algorithm, we give no thought to efficiency.
48 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
49 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
50 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
Your score is
The average score is 40%
Restart quiz
