CS502-Midterm
1 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
2 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
3 / 50
Quick sort is best from the perspective of Locality of reference.
4 / 50
What type of instructions Random Access Machine (RAM) can execute?
5 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
6 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
7 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
8 / 50
Efficient algorithm requires less computational…….
9 / 50
______________ graphical representation of algorithm.
10 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
11 / 50
Cont sort is suitable to sort the elements in range 1 to k
12 / 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.
13 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
14 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
15 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
16 / 50
Which may be a stable sort?
17 / 50
The sieve technique is a special case, where the number of sub problems is just
18 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
19 / 50
A RAM is an idealized machine with ______________ random-access memory.
20 / 50
The sieve technique works in ___________ as follows
21 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
22 / 50
In Sieve Technique we do not know which item is of interest
23 / 50
24 / 50
Divide-and-conquer as breaking the problem into a small number of
25 / 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.
26 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
27 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
28 / 50
A heap is a left-complete binary tree that conforms to the ___________
29 / 50
Which sorting algorithm is faster
30 / 50
_______________ is a graphical representation of an algorithm
31 / 50
What is the total time to heapify?
32 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
33 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
34 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
35 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
36 / 50
One example of in place but not stable algorithm is
37 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
38 / 50
For the sieve technique we solve the problem,
39 / 50
After sorting in merge sort algorithm, merging process is invoked.
40 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
41 / 50
Due to left complete nature of binary tree, the heap can be stored in
42 / 50
In ____________ we have to find rank of an element from given input.
43 / 50
Algorithm is concerned with.......issues.
44 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
45 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
46 / 50
The O-notation is used to state only the asymptotic ________bounds.
47 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
48 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
49 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
50 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
Your score is
The average score is 40%
Restart quiz
