CS502-Midterm
1 / 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.
2 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
3 / 50
What is the total time to heapify?
4 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
5 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
6 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
7 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
8 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
9 / 50
One Example of in place but not stable sort is
10 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
11 / 50
_______________ is a graphical representation of an algorithm
12 / 50
In simple brute-force algorithm, we give no thought to efficiency.
13 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
14 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
15 / 50
For the heap sort we store the tree nodes in
16 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
17 / 50
Analysis of Selection algorithm ends up with,
18 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
19 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
20 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
21 / 50
Which may be stable sort:
22 / 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.
23 / 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.
24 / 50
25 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
26 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
27 / 50
In Sieve Technique we do not know which item is of interest
28 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
29 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
30 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
31 / 50
The sieve technique works in ___________ as follows
32 / 50
For the heap sort, access to nodes involves simple _______________ operations.
33 / 50
In which order we can sort?
34 / 50
Quick sort is
35 / 50
The number of nodes in a complete binary tree of height h is
36 / 50
The O-notation is used to state only the asymptotic ________bounds.
37 / 50
Random access machine or RAM is a/an
38 / 50
The Knapsack problem belongs to the domain of _______________ problems.
39 / 50
Which sorting algorithm is faster
40 / 50
For the Sieve Technique we take time
41 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
42 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
43 / 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,
44 / 50
In Quick Sort Constants hidden in T(n log n) are
45 / 50
How much time merge sort takes for an array of numbers?
46 / 50
Cont sort is suitable to sort the elements in range 1 to k
47 / 50
Slow sorting algorithms run in,
48 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
49 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
50 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
Your score is
The average score is 40%
Restart quiz
