CS502-Midterm
1 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
2 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
3 / 50
In Sieve Technique we do not know which item is of interest
4 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
5 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
6 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
7 / 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,
8 / 50
_______________ is a graphical representation of an algorithm
9 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
10 / 50
For the Sieve Technique we take time
11 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
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 is the solution to the recurrence T(n) = T(n/2)+n .
14 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
15 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
16 / 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.
17 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
18 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
19 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
20 / 50
After sorting in merge sort algorithm, merging process is invoked.
21 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
22 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
23 / 50
Sieve Technique can be applied to selection problem?
24 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
25 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
26 / 50
In ____________ we have to find rank of an element from given input.
27 / 50
For the heap sort, access to nodes involves simple _______________ operations.
28 / 50
Analysis of Selection algorithm ends up with,
29 / 50
In Quick Sort Constants hidden in T(n log n) are
30 / 50
Quick sort is
31 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
32 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
33 / 50
When we call heapify then at each level the comparison performed takes time
34 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
35 / 50
Due to left complete nature of binary tree, the heap can be stored in
36 / 50
In which order we can sort?
37 / 50
What type of instructions Random Access Machine (RAM) can execute?
38 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
39 / 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
40 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
41 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
42 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
43 / 50
Sorting can be in _________
44 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
45 / 50
One example of in place but not stable algorithm is
46 / 50
For the heap sort we store the tree nodes in
47 / 50
Divide-and-conquer as breaking the problem into a small number of
48 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
49 / 50
Which may be stable sort:
50 / 50
The Knapsack problem belongs to the domain of _______________ problems.
Your score is
The average score is 40%
Restart quiz
