CS502-Midterm
1 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
2 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
3 / 50
Cont sort is suitable to sort the elements in range 1 to k
4 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
5 / 50
If we associate (x, y) integers pair to cars where x is the speed of the car and y is the negation of the price. High y value for a car means a ________ car.
6 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
7 / 50
What is the total time to heapify?
8 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
9 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
10 / 50
Which may be a stable sort?
11 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
12 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
13 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
14 / 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.
15 / 50
For the heap sort, access to nodes involves simple _______________ operations.
16 / 50
The O-notation is used to state only the asymptotic ________bounds.
17 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
18 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
19 / 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
20 / 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,
21 / 50
_______________ is a graphical representation of an algorithm
22 / 50
Due to left complete nature of binary tree, the heap can be stored in
23 / 50
A RAM is an idealized machine with ______________ random-access memory.
24 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
25 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
26 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
27 / 50
Divide-and-conquer as breaking the problem into a small number of
28 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
29 / 50
30 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
31 / 50
In Quick Sort Constants hidden in T(n log n) are
32 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
33 / 50
Counting sort has time complexity:
34 / 50
After sorting in merge sort algorithm, merging process is invoked.
35 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
36 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
37 / 50
In Sieve Technique we do not know which item is of interest
38 / 50
For the Sieve Technique we take time
39 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
40 / 50
41 / 50
In ____________ we have to find rank of an element from given input.
42 / 50
The number of nodes in a complete binary tree of height h is
43 / 50
______________ graphical representation of algorithm.
44 / 50
For the sieve technique we solve the problem,
45 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
46 / 50
For the heap sort we store the tree nodes in
47 / 50
Analysis of Selection algorithm ends up with,
48 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
49 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
50 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
Your score is
The average score is 40%
Restart quiz
