CS502-Midterm
1 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
2 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
3 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
4 / 50
Due to left complete nature of binary tree, the heap can be stored in
5 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
6 / 50
In Heap Sort algorithm, if heap property is violated _________
7 / 50
Algorithm is concerned with.......issues.
8 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
9 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
10 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
11 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
12 / 50
Divide-and-conquer as breaking the problem into a small number of
13 / 50
Which sorting algorithm is faster
14 / 50
In Quick Sort Constants hidden in T(n log n) are
15 / 50
_______________ is a graphical representation of an algorithm
16 / 50
Which may be a stable sort?
17 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
18 / 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.
19 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
20 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
21 / 50
For the Sieve Technique we take time
22 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
23 / 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.
24 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
25 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
26 / 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
27 / 50
28 / 50
In which order we can sort?
29 / 50
The number of nodes in a complete binary tree of height h is
30 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
31 / 50
What is the total time to heapify?
32 / 50
33 / 50
34 / 50
In Sieve Technique we do not know which item is of interest
35 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
36 / 50
For the heap sort we store the tree nodes in
37 / 50
The O-notation is used to state only the asymptotic ________bounds.
38 / 50
For the sieve technique we solve the problem,
39 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
40 / 50
41 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
42 / 50
The sieve technique is a special case, where the number of sub problems is just
43 / 50
Which may be stable sort:
44 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
45 / 50
Random access machine or RAM is a/an
46 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
47 / 50
Efficient algorithm requires less computational…….
48 / 50
Sieve Technique can be applied to selection problem?
49 / 50
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
