CS502-Midterm
1 / 50
Counting sort has time complexity:
2 / 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.
3 / 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,
4 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
5 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
6 / 50
How much time merge sort takes for an array of numbers?
7 / 50
In Heap Sort algorithm, if heap property is violated _________
8 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
9 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
10 / 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.
11 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
12 / 50
Cont sort is suitable to sort the elements in range 1 to k
13 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
14 / 50
In Sieve Technique we do not know which item is of interest
15 / 50
Slow sorting algorithms run in,
16 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
17 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
18 / 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.
19 / 50
In Quick Sort Constants hidden in T(n log n) are
20 / 50
Sieve Technique can be applied to selection problem?
21 / 50
One Example of in place but not stable sort is
22 / 50
For the heap sort, access to nodes involves simple _______________ operations.
23 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
24 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
25 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
26 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
27 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
28 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
29 / 50
Is it possible to sort without making comparisons?
30 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
31 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
32 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
33 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
34 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
35 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
36 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
37 / 50
_______________ is a graphical representation of an algorithm
38 / 50
Divide-and-conquer as breaking the problem into a small number of
39 / 50
For the sieve technique we solve the problem,
40 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
41 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
42 / 50
Sorting can be in _________
43 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
44 / 50
A RAM is an idealized machine with ______________ random-access memory.
45 / 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.
46 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
47 / 50
Quick sort is
48 / 50
Algorithm is concerned with.......issues.
49 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
50 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
Your score is
The average score is 40%
Restart quiz
