CS502-Midterm
1 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
2 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
3 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
4 / 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.
5 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
6 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
7 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
8 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
9 / 50
Due to left complete nature of binary tree, the heap can be stored in
10 / 50
After sorting in merge sort algorithm, merging process is invoked.
11 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
12 / 50
_______________ is a graphical representation of an algorithm
13 / 50
When we call heapify then at each level the comparison performed takes time
14 / 50
Which may be a stable sort?
15 / 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
16 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
17 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
18 / 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.
19 / 50
Analysis of Selection algorithm ends up with,
20 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
21 / 50
Slow sorting algorithms run in,
22 / 50
Algorithm is concerned with.......issues.
23 / 50
24 / 50
In ____________ we have to find rank of an element from given input.
25 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
26 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
27 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
28 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
29 / 50
Sorting can be in _________
30 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
31 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
32 / 50
The O-notation is used to state only the asymptotic ________bounds.
33 / 50
In which order we can sort?
34 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
35 / 50
What is the total time to heapify?
36 / 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.
37 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
38 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
39 / 50
The running time of quick sort depends heavily on the selection of
40 / 50
For the heap sort we store the tree nodes in
41 / 50
One example of in place but not stable algorithm is
42 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
43 / 50
In Sieve Technique we do not know which item is of interest
44 / 50
A RAM is an idealized machine with ______________ random-access memory.
45 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
46 / 50
The number of nodes in a complete binary tree of height h is
47 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
48 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
49 / 50
How much time merge sort takes for an array of numbers?
50 / 50
Counting sort has time complexity:
Your score is
The average score is 40%
Restart quiz
