CS502-Midterm
1 / 50
_______________ is a graphical representation of an algorithm
2 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
3 / 50
In Quick Sort Constants hidden in T(n log n) are
4 / 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.
5 / 50
Which may be stable sort:
6 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
7 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
8 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
9 / 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.
10 / 50
After sorting in merge sort algorithm, merging process is invoked.
11 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
12 / 50
Which may be a stable sort?
13 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
14 / 50
What type of instructions Random Access Machine (RAM) can execute?
15 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
16 / 50
Efficient algorithm requires less computational…….
17 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
18 / 50
In simple brute-force algorithm, we give no thought to efficiency.
19 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
20 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
21 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
22 / 50
Sorting can be in _________
23 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
24 / 50
Sieve Technique can be applied to selection problem?
25 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
26 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
27 / 50
For the Sieve Technique we take time
28 / 50
______________ graphical representation of algorithm.
29 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
30 / 50
Quick sort is best from the perspective of Locality of reference.
31 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
32 / 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,
33 / 50
A heap is a left-complete binary tree that conforms to the ___________
34 / 50
The sieve technique is a special case, where the number of sub problems is just
35 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
36 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
37 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
38 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
39 / 50
Slow sorting algorithms run in,
40 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
41 / 50
Algorithm is concerned with.......issues.
42 / 50
For the sieve technique we solve the problem,
43 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
44 / 50
Analysis of Selection algorithm ends up with,
45 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
46 / 50
In RAM model instructions are executed
47 / 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
48 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
49 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
50 / 50
In which order we can sort?
Your score is
The average score is 40%
Restart quiz
