CS502-Midterm
1 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
2 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
3 / 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.
4 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
5 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
6 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
7 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
8 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
9 / 50
Which may be a stable sort?
10 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
11 / 50
The sieve technique is a special case, where the number of sub problems is just
12 / 50
Which sorting algorithm is faster
13 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
14 / 50
Sorting can be in _________
15 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
16 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
17 / 50
A heap is a left-complete binary tree that conforms to the ___________
18 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
19 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
20 / 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.
21 / 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
22 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
23 / 50
In RAM model instructions are executed
24 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
25 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
26 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
27 / 50
In ____________ we have to find rank of an element from given input.
28 / 50
Slow sorting algorithms run in,
29 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
30 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
31 / 50
What is the total time to heapify?
32 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
33 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
34 / 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.
35 / 50
Which may be stable sort:
36 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
37 / 50
When we call heapify then at each level the comparison performed takes time
38 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
39 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
40 / 50
Due to left complete nature of binary tree, the heap can be stored in
41 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
42 / 50
The number of nodes in a complete binary tree of height h is
43 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
44 / 50
Cont sort is suitable to sort the elements in range 1 to k
45 / 50
What type of instructions Random Access Machine (RAM) can execute?
46 / 50
For the heap sort, access to nodes involves simple _______________ operations.
47 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
48 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
49 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
50 / 50
One example of in place but not stable algorithm is
Your score is
The average score is 40%
Restart quiz
