CS502-Midterm
1 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
2 / 50
Quick sort is best from the perspective of Locality of reference.
3 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
4 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
5 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
6 / 50
In simple brute-force algorithm, we give no thought to efficiency.
7 / 50
______________ graphical representation of algorithm.
8 / 50
For the Sieve Technique we take time
9 / 50
For the sieve technique we solve the problem,
10 / 50
One Example of in place but not stable sort is
11 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
12 / 50
For the heap sort we store the tree nodes in
13 / 50
The sieve technique works in ___________ as follows
14 / 50
Sieve Technique can be applied to selection problem?
15 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
16 / 50
What is the total time to heapify?
17 / 50
Which sorting algorithm is faster
18 / 50
One example of in place but not stable algorithm is
19 / 50
20 / 50
A heap is a left-complete binary tree that conforms to the ___________
21 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
22 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
23 / 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.
24 / 50
Analysis of Selection algorithm ends up with,
25 / 50
Due to left complete nature of binary tree, the heap can be stored in
26 / 50
Which may be stable sort:
27 / 50
The running time of quick sort depends heavily on the selection of
28 / 50
The O-notation is used to state only the asymptotic ________bounds.
29 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
30 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
31 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
32 / 50
In which order we can sort?
33 / 50
Sorting can be in _________
34 / 50
After sorting in merge sort algorithm, merging process is invoked.
35 / 50
In Quick Sort Constants hidden in T(n log n) are
36 / 50
A RAM is an idealized machine with ______________ random-access memory.
37 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
38 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
39 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
40 / 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,
41 / 50
In RAM model instructions are executed
42 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
43 / 50
Consider the following code:
For(j=1; j
For(k=1; k<15;k++)
For(l=5; l
{
Do_something_constant();
}
What is the order of execution for this code.
44 / 50
45 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
46 / 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.
47 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
48 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
49 / 50
Random access machine or RAM is a/an
50 / 50
Your score is
The average score is 40%
Restart quiz
