CS502-Midterm
1 / 50
Is it possible to sort without making comparisons?
2 / 50
Upper bound requires that there exist positive constants c2 and n0 such that f(n) ____ c2n for all n <= n0(ye question ghalat lag raha hai mujhae
3 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
4 / 50
When we call heapify then at each level the comparison performed takes time
5 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
6 / 50
For the sieve technique we solve the problem,
7 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
8 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
9 / 50
A RAM is an idealized machine with ______________ random-access memory.
10 / 50
For the heap sort, access to nodes involves simple _______________ operations.
11 / 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.
12 / 50
One example of in place but not stable algorithm is
13 / 50
Slow sorting algorithms run in,
14 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
15 / 50
A heap is a left-complete binary tree that conforms to the ___________
16 / 50
Random access machine or RAM is a/an
17 / 50
In Heap Sort algorithm, if heap property is violated _________
18 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
19 / 50
Analysis of Selection algorithm ends up with,
20 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
21 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
22 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
23 / 50
After sorting in merge sort algorithm, merging process is invoked.
24 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
25 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
26 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
27 / 50
_______________ is a graphical representation of an algorithm
28 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
29 / 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.
30 / 50
The O-notation is used to state only the asymptotic ________bounds.
31 / 50
Which may be a stable sort?
32 / 50
Efficient algorithm requires less computational…….
33 / 50
One Example of in place but not stable sort is
34 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
35 / 50
In which order we can sort?
36 / 50
Which may be stable sort:
37 / 50
Sieve Technique can be applied to selection problem?
38 / 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,
39 / 50
How much time merge sort takes for an array of numbers?
40 / 50
______________ graphical representation of algorithm.
41 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
42 / 50
In Sieve Technique we do not know which item is of interest
43 / 50
Algorithm is concerned with.......issues.
44 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
45 / 50
For the heap sort we store the tree nodes in
46 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
47 / 50
What is the total time to heapify?
48 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
49 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
50 / 50
For the Sieve Technique we take time
Your score is
The average score is 40%
Restart quiz
