CS502-Midterm
1 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
2 / 50
The sieve technique is a special case, where the number of sub problems is just
3 / 50
In Sieve Technique we do not know which item is of interest
4 / 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.
5 / 50
6 / 50
One Example of in place but not stable sort is
7 / 50
A RAM is an idealized machine with ______________ random-access memory.
8 / 50
Slow sorting algorithms run in,
9 / 50
Quick sort is best from the perspective of Locality of reference.
10 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
11 / 50
When we call heapify then at each level the comparison performed takes time
12 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
13 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
14 / 50
What is the total time to heapify?
15 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
16 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
17 / 50
Which sorting algorithm is faster
18 / 50
Random access machine or RAM is a/an
19 / 50
In Quick Sort Constants hidden in T(n log n) are
20 / 50
21 / 50
______________ graphical representation of algorithm.
22 / 50
Is it possible to sort without making comparisons?
23 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
24 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
25 / 50
The Knapsack problem belongs to the domain of _______________ problems.
26 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
27 / 50
Efficient algorithm requires less computational…….
28 / 50
The O-notation is used to state only the asymptotic ________bounds.
29 / 50
Analysis of Selection algorithm ends up with,
30 / 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.
31 / 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,
32 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
33 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
34 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
35 / 50
In RAM model instructions are executed
36 / 50
If we associate (x, y) integers pair to cars where x is the speed of the car and y is the negation of the price. High y value for a car means a ________ car.
37 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
38 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
39 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
40 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
41 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
42 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
43 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
44 / 50
Cont sort is suitable to sort the elements in range 1 to k
45 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
46 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
47 / 50
48 / 50
Sieve Technique can be applied to selection problem?
49 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
50 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
Your score is
The average score is 40%
Restart quiz
