CS502-Midterm
1 / 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.
2 / 50
In which order we can sort?
3 / 50
The Knapsack problem belongs to the domain of _______________ problems.
4 / 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
5 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
6 / 50
Sieve Technique can be applied to selection problem?
7 / 50
One example of in place but not stable algorithm is
8 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
9 / 50
Counting sort has time complexity:
10 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
11 / 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.
12 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
13 / 50
Cont sort is suitable to sort the elements in range 1 to k
14 / 50
What is the total time to heapify?
15 / 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,
16 / 50
How much time merge sort takes for an array of numbers?
17 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
18 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
19 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
20 / 50
In Sieve Technique we do not know which item is of interest
21 / 50
Efficient algorithm requires less computational…….
22 / 50
In Heap Sort algorithm, if heap property is violated _________
23 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
24 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
25 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
26 / 50
27 / 50
The sieve technique is a special case, where the number of sub problems is just
28 / 50
In simple brute-force algorithm, we give no thought to efficiency.
29 / 50
What type of instructions Random Access Machine (RAM) can execute?
30 / 50
When we call heapify then at each level the comparison performed takes time
31 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
32 / 50
Is it possible to sort without making comparisons?
33 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
34 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
35 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
36 / 50
Random access machine or RAM is a/an
37 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
38 / 50
For the sieve technique we solve the problem,
39 / 50
Divide-and-conquer as breaking the problem into a small number of
40 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
41 / 50
The O-notation is used to state only the asymptotic ________bounds.
42 / 50
In Quick Sort Constants hidden in T(n log n) are
43 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
44 / 50
For the heap sort, access to nodes involves simple _______________ operations.
45 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
46 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
47 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
48 / 50
For the Sieve Technique we take time
49 / 50
Quick sort is
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
