CS502-Midterm
1 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
2 / 50
The sieve technique is a special case, where the number of sub problems is just
3 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
4 / 50
Which sorting algorithm is faster
5 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
6 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
7 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
8 / 50
A RAM is an idealized machine with ______________ random-access memory.
9 / 50
Divide-and-conquer as breaking the problem into a small number of
10 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
11 / 50
One Example of in place but not stable sort is
12 / 50
The running time of quick sort depends heavily on the selection of
13 / 50
When we call heapify then at each level the comparison performed takes time
14 / 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.
15 / 50
In simple brute-force algorithm, we give no thought to efficiency.
16 / 50
For the heap sort, access to nodes involves simple _______________ operations.
17 / 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.
18 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
19 / 50
In RAM model instructions are executed
20 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
21 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
22 / 50
Efficient algorithm requires less computational…….
23 / 50
Which may be stable sort:
24 / 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.
25 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
26 / 50
For the Sieve Technique we take time
27 / 50
Quick sort is
28 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
29 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
30 / 50
Sorting can be in _________
31 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
32 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
33 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
34 / 50
In ____________ we have to find rank of an element from given input.
35 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
36 / 50
One example of in place but not stable algorithm is
37 / 50
38 / 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
39 / 50
In Heap Sort algorithm, if heap property is violated _________
40 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
41 / 50
In Sieve Technique we do not know which item is of interest
42 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
43 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
44 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
45 / 50
What is the total time to heapify?
46 / 50
Due to left complete nature of binary tree, the heap can be stored in
47 / 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.
48 / 50
The O-notation is used to state only the asymptotic ________bounds.
49 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
50 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
Your score is
The average score is 40%
Restart quiz
