CS502-Midterm
1 / 50
For the Sieve Technique we take time
2 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
3 / 50
For the heap sort, access to nodes involves simple _______________ operations.
4 / 50
One Example of in place but not stable sort is
5 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
6 / 50
In Quick Sort Constants hidden in T(n log n) are
7 / 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.
8 / 50
______________ graphical representation of algorithm.
9 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
10 / 50
For the sieve technique we solve the problem,
11 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
12 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
13 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
14 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
15 / 50
Sorting can be in _________
16 / 50
The number of nodes in a complete binary tree of height h is
17 / 50
Which may be stable sort:
18 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
19 / 50
Efficient algorithm requires less computational…….
20 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
21 / 50
Algorithm is concerned with.......issues.
22 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
23 / 50
The O-notation is used to state only the asymptotic ________bounds.
24 / 50
When we call heapify then at each level the comparison performed takes time
25 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
26 / 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.
27 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
28 / 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.
29 / 50
In Sieve Technique we do not know which item is of interest
30 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
31 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
32 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
33 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
34 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
35 / 50
For the heap sort we store the tree nodes in
36 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
37 / 50
Slow sorting algorithms run in,
38 / 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.
39 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
40 / 50
Which may be a stable sort?
41 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
42 / 50
Which sorting algorithm is faster
43 / 50
_______________ is a graphical representation of an algorithm
44 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
45 / 50
After sorting in merge sort algorithm, merging process is invoked.
46 / 50
In RAM model instructions are executed
47 / 50
Cont sort is suitable to sort the elements in range 1 to k
48 / 50
Divide-and-conquer as breaking the problem into a small number of
49 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
50 / 50
Your score is
The average score is 40%
Restart quiz
