CS502-Midterm
1 / 50
For the sieve technique we solve the problem,
2 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
3 / 50
A heap is a left-complete binary tree that conforms to the ___________
4 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
5 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
6 / 50
When we call heapify then at each level the comparison performed takes time
7 / 50
Is it possible to sort without making comparisons?
8 / 50
A RAM is an idealized machine with ______________ random-access memory.
9 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
10 / 50
For the heap sort we store the tree nodes in
11 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
12 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
13 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
14 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
15 / 50
What is the total time to heapify?
16 / 50
Analysis of Selection algorithm ends up with,
17 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
18 / 50
One Example of in place but not stable sort is
19 / 50
In Sieve Technique we do not know which item is of interest
20 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
21 / 50
The number of nodes in a complete binary tree of height h is
22 / 50
In Quick Sort Constants hidden in T(n log n) are
23 / 50
In Heap Sort algorithm, if heap property is violated _________
24 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
25 / 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.
26 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
27 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
28 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
29 / 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,
30 / 50
How much time merge sort takes for an array of numbers?
31 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
32 / 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.
33 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
34 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
35 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
36 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
37 / 50
Due to left complete nature of binary tree, the heap can be stored in
38 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
39 / 50
Divide-and-conquer as breaking the problem into a small number of
40 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
41 / 50
42 / 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
43 / 50
Which may be a stable sort?
44 / 50
45 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
46 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
47 / 50
The running time of quick sort depends heavily on the selection of
48 / 50
49 / 50
______________ graphical representation of algorithm.
50 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
Your score is
The average score is 40%
Restart quiz
