CS502-Midterm
1 / 50
Is it possible to sort without making comparisons?
2 / 50
What type of instructions Random Access Machine (RAM) can execute?
3 / 50
The sieve technique is a special case, where the number of sub problems is just
4 / 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.
5 / 50
In RAM model instructions are executed
6 / 50
What is the total time to heapify?
7 / 50
One Example of in place but not stable sort is
8 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
9 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
10 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
11 / 50
The running time of quick sort depends heavily on the selection of
12 / 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.
13 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
14 / 50
In Sieve Technique we do not know which item is of interest
15 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
16 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
17 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
18 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
19 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
20 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
21 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
22 / 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.
23 / 50
Which may be stable sort:
24 / 50
In Quick Sort Constants hidden in T(n log n) are
25 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
26 / 50
27 / 50
After sorting in merge sort algorithm, merging process is invoked.
28 / 50
Quick sort is
29 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
30 / 50
A heap is a left-complete binary tree that conforms to the ___________
31 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
32 / 50
Analysis of Selection algorithm ends up with,
33 / 50
In simple brute-force algorithm, we give no thought to efficiency.
34 / 50
In which order we can sort?
35 / 50
Which sorting algorithm is faster
36 / 50
For the sieve technique we solve the problem,
37 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
38 / 50
39 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
40 / 50
Random access machine or RAM is a/an
41 / 50
42 / 50
_______________ is a graphical representation of an algorithm
43 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
44 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
45 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
46 / 50
The number of nodes in a complete binary tree of height h is
47 / 50
For the heap sort, access to nodes involves simple _______________ operations.
48 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
49 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
50 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
Your score is
The average score is 40%
Restart quiz
