CS502-Midterm
1 / 50
When we call heapify then at each level the comparison performed takes time
2 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
3 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
4 / 50
In Quick Sort Constants hidden in T(n log n) are
5 / 50
For the heap sort we store the tree nodes in
6 / 50
Is it possible to sort without making comparisons?
7 / 50
What is the total time to heapify?
8 / 50
A RAM is an idealized machine with ______________ random-access memory.
9 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
10 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
11 / 50
How much time merge sort takes for an array of numbers?
12 / 50
Quick sort is best from the perspective of Locality of reference.
13 / 50
In Sieve Technique we do not know which item is of interest
14 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
15 / 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.
16 / 50
Algorithm is concerned with.......issues.
17 / 50
Which sorting algorithm is faster
18 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
19 / 50
Slow sorting algorithms run in,
20 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
21 / 50
The running time of quick sort depends heavily on the selection of
22 / 50
In Heap Sort algorithm, if heap property is violated _________
23 / 50
24 / 50
25 / 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.
26 / 50
Which may be a stable sort?
27 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
28 / 50
After sorting in merge sort algorithm, merging process is invoked.
29 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
30 / 50
The sieve technique is a special case, where the number of sub problems is just
31 / 50
The number of nodes in a complete binary tree of height h is
32 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
33 / 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.
34 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
35 / 50
Due to left complete nature of binary tree, the heap can be stored in
36 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
37 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
38 / 50
Upper bound requires that there exist positive constants c2 and n0 such that f(n) ____ c2n for all n <= n0(ye question ghalat lag raha hai mujhae
39 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
40 / 50
In which order we can sort?
41 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
42 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
43 / 50
_______________ is a graphical representation of an algorithm
44 / 50
For the Sieve Technique we take time
45 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
46 / 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,
47 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
48 / 50
Quick sort is
49 / 50
For the heap sort, access to nodes involves simple _______________ operations.
50 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
Your score is
The average score is 40%
Restart quiz
