CS502-Midterm
1 / 50
The Knapsack problem belongs to the domain of _______________ problems.
2 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
3 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
4 / 50
One Example of in place but not stable sort is
5 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
6 / 50
When we call heapify then at each level the comparison performed takes time
7 / 50
In Quick Sort Constants hidden in T(n log n) are
8 / 50
What is the total time to heapify?
9 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
10 / 50
For the Sieve Technique we take time
11 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
12 / 50
What type of instructions Random Access Machine (RAM) can execute?
13 / 50
Slow sorting algorithms run in,
14 / 50
In Sieve Technique we do not know which item is of interest
15 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
16 / 50
The sieve technique is a special case, where the number of sub problems is just
17 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
18 / 50
How much time merge sort takes for an array of numbers?
19 / 50
In RAM model instructions are executed
20 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
21 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
22 / 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
23 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
24 / 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,
25 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
26 / 50
Divide-and-conquer as breaking the problem into a small number of
27 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
28 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
29 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
30 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
31 / 50
Cont sort is suitable to sort the elements in range 1 to k
32 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
33 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
34 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
35 / 50
36 / 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.
37 / 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.
38 / 50
Random access machine or RAM is a/an
39 / 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.
40 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
41 / 50
Sorting can be in _________
42 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
43 / 50
The O-notation is used to state only the asymptotic ________bounds.
44 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
45 / 50
46 / 50
A heap is a left-complete binary tree that conforms to the ___________
47 / 50
Is it possible to sort without making comparisons?
48 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
49 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
50 / 50
After sorting in merge sort algorithm, merging process is invoked.
Your score is
The average score is 40%
Restart quiz
