CS502-Midterm
1 / 50
Due to left complete nature of binary tree, the heap can be stored in
2 / 50
The sieve technique works in ___________ as follows
3 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
4 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
5 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
6 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
7 / 50
A heap is a left-complete binary tree that conforms to the ___________
8 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
9 / 50
______________ graphical representation of algorithm.
10 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
11 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
12 / 50
In RAM model instructions are executed
13 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
14 / 50
When we call heapify then at each level the comparison performed takes time
15 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
16 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
17 / 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.
18 / 50
The O-notation is used to state only the asymptotic ________bounds.
19 / 50
Sorting can be in _________
20 / 50
Is it possible to sort without making comparisons?
21 / 50
In Sieve Technique we do not know which item is of interest
22 / 50
Which sorting algorithm is faster
23 / 50
One example of in place but not stable algorithm is
24 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
25 / 50
Random access machine or RAM is a/an
26 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
27 / 50
For the sieve technique we solve the problem,
28 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
29 / 50
In which order we can sort?
30 / 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.
31 / 50
For the Sieve Technique we take time
32 / 50
In simple brute-force algorithm, we give no thought to efficiency.
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
In Heap Sort algorithm, if heap property is violated _________
35 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
36 / 50
Which may be stable sort:
37 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
38 / 50
A RAM is an idealized machine with ______________ random-access memory.
39 / 50
Quick sort is best from the perspective of Locality of reference.
40 / 50
41 / 50
What type of instructions Random Access Machine (RAM) can execute?
42 / 50
43 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
44 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
45 / 50
Which may be a stable sort?
46 / 50
In Quick Sort Constants hidden in T(n log n) are
47 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
48 / 50
After sorting in merge sort algorithm, merging process is invoked.
49 / 50
What is the total time to heapify?
50 / 50
Your score is
The average score is 40%
Restart quiz
