CS502-Midterm
1 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
2 / 50
In Sieve Technique we do not know which item is of interest
3 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
4 / 50
In Heap Sort algorithm, if heap property is violated _________
5 / 50
Slow sorting algorithms run in,
6 / 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
7 / 50
______________ graphical representation of algorithm.
8 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
9 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
10 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
11 / 50
What is the total time to heapify?
12 / 50
Is it possible to sort without making comparisons?
13 / 50
For the heap sort we store the tree nodes in
14 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
15 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
16 / 50
The function f(n)= n(logn+1)/2 is asymptotically equivalent to n log n. Here Upper Bound means the function f(n) grows asymptotically ____________ faster than n log n.
17 / 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.
18 / 50
Algorithm is concerned with.......issues.
19 / 50
The sieve technique is a special case, where the number of sub problems is just
20 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
21 / 50
Which may be stable sort:
22 / 50
Consider the following code:
For(j=1; j
For(k=1; k<15;k++)
For(l=5; l
{
Do_something_constant();
}
What is the order of execution for this code.
23 / 50
24 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
25 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
26 / 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.
27 / 50
The Knapsack problem belongs to the domain of _______________ problems.
28 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
29 / 50
In ____________ we have to find rank of an element from given input.
30 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
31 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
32 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
33 / 50
In Quick Sort Constants hidden in T(n log n) are
34 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
35 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
36 / 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,
37 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
38 / 50
For the sieve technique we solve the problem,
39 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
40 / 50
A RAM is an idealized machine with ______________ random-access memory.
41 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
42 / 50
Cont sort is suitable to sort the elements in range 1 to k
43 / 50
For the Sieve Technique we take time
44 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
45 / 50
The sieve technique works in ___________ as follows
46 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
47 / 50
In which order we can sort?
48 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
49 / 50
How much time merge sort takes for an array of numbers?
50 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
Your score is
The average score is 40%
Restart quiz
