CS502-Midterm
1 / 50
Efficient algorithm requires less computational…….
2 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
3 / 50
Random access machine or RAM is a/an
4 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
5 / 50
For the heap sort we store the tree nodes in
6 / 50
A heap is a left-complete binary tree that conforms to the ___________
7 / 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
8 / 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.
9 / 50
Which may be a stable sort?
10 / 50
Which may be stable sort:
11 / 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,
12 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
13 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
14 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
15 / 50
The O-notation is used to state only the asymptotic ________bounds.
16 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
17 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
18 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
19 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
20 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
21 / 50
In Sieve Technique we do not know which item is of interest
22 / 50
In ____________ we have to find rank of an element from given input.
23 / 50
A RAM is an idealized machine with ______________ random-access memory.
24 / 50
Slow sorting algorithms run in,
25 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
26 / 50
In Quick Sort Constants hidden in T(n log n) are
27 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
28 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
29 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
30 / 50
One Example of in place but not stable sort is
31 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
32 / 50
After sorting in merge sort algorithm, merging process is invoked.
33 / 50
The sieve technique works in ___________ as follows
34 / 50
The sieve technique is a special case, where the number of sub problems is just
35 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
36 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
37 / 50
In RAM model instructions are executed
38 / 50
Due to left complete nature of binary tree, the heap can be stored in
39 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
40 / 50
41 / 50
Counting sort has time complexity:
42 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
43 / 50
______________ graphical representation of algorithm.
44 / 50
For the heap sort, access to nodes involves simple _______________ operations.
45 / 50
46 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
47 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
48 / 50
What is the total time to heapify?
49 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
50 / 50
Your score is
The average score is 40%
Restart quiz
