CS502-Midterm
1 / 50
Due to left complete nature of binary tree, the heap can be stored in
2 / 50
One Example of in place but not stable sort is
3 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
4 / 50
In Quick Sort Constants hidden in T(n log n) are
5 / 50
Efficient algorithm requires less computational…….
6 / 50
Quick sort is
7 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
8 / 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.
9 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
10 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
11 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
12 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
13 / 50
In which order we can sort?
14 / 50
Which may be stable sort:
15 / 50
Slow sorting algorithms run in,
16 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
17 / 50
One example of in place but not stable algorithm is
18 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
19 / 50
After sorting in merge sort algorithm, merging process is invoked.
20 / 50
In Sieve Technique we do not know which item is of interest
21 / 50
Divide-and-conquer as breaking the problem into a small number of
22 / 50
Which may be a stable sort?
23 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
24 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
25 / 50
______________ graphical representation of algorithm.
26 / 50
Quick sort is best from the perspective of Locality of reference.
27 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
28 / 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.
29 / 50
30 / 50
For the Sieve Technique we take time
31 / 50
For the heap sort, access to nodes involves simple _______________ operations.
32 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
33 / 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,
34 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
35 / 50
When we call heapify then at each level the comparison performed takes time
36 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
37 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
38 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
39 / 50
40 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
41 / 50
A RAM is an idealized machine with ______________ random-access memory.
42 / 50
What is the total time to heapify?
43 / 50
Sieve Technique can be applied to selection problem?
44 / 50
In ____________ we have to find rank of an element from given input.
45 / 50
A heap is a left-complete binary tree that conforms to the ___________
46 / 50
Sorting can be in _________
47 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
48 / 50
For the sieve technique we solve the problem,
49 / 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.
50 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
Your score is
The average score is 40%
Restart quiz
