CS502-Midterm
1 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
2 / 50
In Sieve Technique we do not know which item is of interest
3 / 50
In Heap Sort algorithm, if heap property is violated _________
4 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
5 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
6 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
7 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
8 / 50
Algorithm is concerned with.......issues.
9 / 50
After sorting in merge sort algorithm, merging process is invoked.
10 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
11 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
12 / 50
In simple brute-force algorithm, we give no thought to efficiency.
13 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
14 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
15 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
16 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
17 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
18 / 50
In ____________ we have to find rank of an element from given input.
19 / 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.
20 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
21 / 50
Which sorting algorithm is faster
22 / 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,
23 / 50
Sorting can be in _________
24 / 50
25 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
26 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
27 / 50
Analysis of Selection algorithm ends up with,
28 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
29 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
30 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
31 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
32 / 50
The O-notation is used to state only the asymptotic ________bounds.
33 / 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.
34 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
35 / 50
For the Sieve Technique we take time
36 / 50
Is it possible to sort without making comparisons?
37 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
38 / 50
Cont sort is suitable to sort the elements in range 1 to k
39 / 50
_______________ is a graphical representation of an algorithm
40 / 50
41 / 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
42 / 50
Sieve Technique can be applied to selection problem?
43 / 50
What is the total time to heapify?
44 / 50
Divide-and-conquer as breaking the problem into a small number of
45 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
46 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
47 / 50
A heap is a left-complete binary tree that conforms to the ___________
48 / 50
Slow sorting algorithms run in,
49 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
50 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
Your score is
The average score is 40%
Restart quiz
