CS502-Midterm
1 / 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.
2 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
3 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
4 / 50
What type of instructions Random Access Machine (RAM) can execute?
5 / 50
Cont sort is suitable to sort the elements in range 1 to k
6 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
7 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
8 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
9 / 50
The O-notation is used to state only the asymptotic ________bounds.
10 / 50
What is the total time to heapify?
11 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
12 / 50
Random access machine or RAM is a/an
13 / 50
The Knapsack problem belongs to the domain of _______________ problems.
14 / 50
A heap is a left-complete binary tree that conforms to the ___________
15 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
16 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
17 / 50
Due to left complete nature of binary tree, the heap can be stored in
18 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
19 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
20 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
21 / 50
A RAM is an idealized machine with ______________ random-access memory.
22 / 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
23 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
24 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
25 / 50
Is it possible to sort without making comparisons?
26 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
27 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
28 / 50
How much time merge sort takes for an array of numbers?
29 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
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
In Heap Sort algorithm, if heap property is violated _________
32 / 50
In ____________ we have to find rank of an element from given input.
33 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
34 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
35 / 50
36 / 50
37 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
38 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
39 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
40 / 50
One Example of in place but not stable sort is
41 / 50
______________ graphical representation of algorithm.
42 / 50
The sieve technique is a special case, where the number of sub problems is just
43 / 50
Quick sort is best from the perspective of Locality of reference.
44 / 50
In Sieve Technique we do not know which item is of interest
45 / 50
Algorithm is concerned with.......issues.
46 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
47 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
48 / 50
For the heap sort we store the tree nodes in
49 / 50
Which sorting algorithm is faster
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
