CS502-Midterm
1 / 50
For the sieve technique we solve the problem,
2 / 50
The number of nodes in a complete binary tree of height h is
3 / 50
In Quick Sort Constants hidden in T(n log n) are
4 / 50
Due to left complete nature of binary tree, the heap can be stored in
5 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
6 / 50
In simple brute-force algorithm, we give no thought to efficiency.
7 / 50
The running time of quick sort depends heavily on the selection of
8 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
9 / 50
______________ graphical representation of algorithm.
10 / 50
Cont sort is suitable to sort the elements in range 1 to k
11 / 50
For the heap sort we store the tree nodes in
12 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
13 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
14 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
15 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
16 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
17 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
18 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
19 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
20 / 50
What is the total time to heapify?
21 / 50
In ____________ we have to find rank of an element from given input.
22 / 50
Which may be stable sort:
23 / 50
Efficient algorithm requires less computational…….
24 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
25 / 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,
26 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
27 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
28 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
29 / 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.
30 / 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.
31 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
32 / 50
Slow sorting algorithms run in,
33 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
34 / 50
How much time merge sort takes for an array of numbers?
35 / 50
A heap is a left-complete binary tree that conforms to the ___________
36 / 50
37 / 50
What type of instructions Random Access Machine (RAM) can execute?
38 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
39 / 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.
40 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
41 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
42 / 50
In Sieve Technique we do not know which item is of interest
43 / 50
Algorithm is concerned with.......issues.
44 / 50
When we call heapify then at each level the comparison performed takes time
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
In Heap Sort algorithm, we build _______ for ascending sort.
47 / 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.
48 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
49 / 50
Sieve Technique can be applied to selection problem?
50 / 50
_______________ is a graphical representation of an algorithm
Your score is
The average score is 40%
Restart quiz
