CS502-Midterm
1 / 50
The sieve technique works in ___________ as follows
2 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
3 / 50
Which may be stable sort:
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
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
6 / 50
Algorithm is concerned with.......issues.
7 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
8 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
9 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
10 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
11 / 50
For the Sieve Technique we take time
12 / 50
In Heap Sort algorithm, if heap property is violated _________
13 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
14 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
15 / 50
For the heap sort, access to nodes involves simple _______________ operations.
16 / 50
The O-notation is used to state only the asymptotic ________bounds.
17 / 50
Cont sort is suitable to sort the elements in range 1 to k
18 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
19 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
20 / 50
Sieve Technique can be applied to selection problem?
21 / 50
One Example of in place but not stable sort is
22 / 50
A heap is a left-complete binary tree that conforms to the ___________
23 / 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
24 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
25 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
26 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
27 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
28 / 50
In which order we can sort?
29 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
30 / 50
Random access machine or RAM is a/an
31 / 50
What is the total time to heapify?
32 / 50
Analysis of Selection algorithm ends up with,
33 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
34 / 50
Is it possible to sort without making comparisons?
35 / 50
The Knapsack problem belongs to the domain of _______________ problems.
36 / 50
The sieve technique is a special case, where the number of sub problems is just
37 / 50
38 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
39 / 50
Sorting can be in _________
40 / 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,
41 / 50
Which may be a stable sort?
42 / 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.
43 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
44 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
45 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
46 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
47 / 50
How much time merge sort takes for an array of numbers?
48 / 50
The running time of quick sort depends heavily on the selection of
49 / 50
In Sieve Technique we do not know which item is of interest
50 / 50
In ____________ we have to find rank of an element from given input.
Your score is
The average score is 40%
Restart quiz
