CS502-Midterm
1 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
2 / 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.
3 / 50
Slow sorting algorithms run in,
4 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
5 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
6 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
7 / 50
The O-notation is used to state only the asymptotic ________bounds.
8 / 50
A RAM is an idealized machine with ______________ random-access memory.
9 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
10 / 50
A heap is a left-complete binary tree that conforms to the ___________
11 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
12 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
13 / 50
Sieve Technique can be applied to selection problem?
14 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
15 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
16 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
17 / 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.
18 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
19 / 50
For the sieve technique we solve the problem,
20 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
21 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
22 / 50
In RAM model instructions are executed
23 / 50
______________ graphical representation of algorithm.
24 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
25 / 50
Quick sort is
26 / 50
Quick sort is best from the perspective of Locality of reference.
27 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
28 / 50
Counting sort has time complexity:
29 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
30 / 50
Sorting can be in _________
31 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
32 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
33 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
34 / 50
In ____________ we have to find rank of an element from given input.
35 / 50
The number of nodes in a complete binary tree of height h is
36 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
37 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
38 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
39 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
40 / 50
The sieve technique is a special case, where the number of sub problems is just
41 / 50
Which sorting algorithm is faster
42 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
43 / 50
What type of instructions Random Access Machine (RAM) can execute?
44 / 50
Cont sort is suitable to sort the elements in range 1 to k
45 / 50
44.The running time of an algorithm would not depend upon the optimization by the compiler but that of an implementation of the algorithm would depend on it.
46 / 50
What is the total time to heapify?
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
Which may be a stable sort?
49 / 50
50 / 50
In Sieve Technique we do not know which item is of interest
Your score is
The average score is 40%
Restart quiz
