CS502-Midterm
1 / 50
In Quick Sort Constants hidden in T(n log n) are
2 / 50
What type of instructions Random Access Machine (RAM) can execute?
3 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
4 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
5 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
6 / 50
The sieve technique works in ___________ as follows
7 / 50
For the Sieve Technique we take time
8 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
9 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
10 / 50
Cont sort is suitable to sort the elements in range 1 to k
11 / 50
12 / 50
Due to left complete nature of binary tree, the heap can be stored in
13 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
14 / 50
Divide-and-conquer as breaking the problem into a small number of
15 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
16 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
17 / 50
In ____________ we have to find rank of an element from given input.
18 / 50
The O-notation is used to state only the asymptotic ________bounds.
19 / 50
One Example of in place but not stable sort is
20 / 50
The running time of quick sort depends heavily on the selection of
21 / 50
In Sieve Technique we do not know which item is of interest
22 / 50
_______________ is a graphical representation of an algorithm
23 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
24 / 50
Counting sort has time complexity:
25 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
26 / 50
Random access machine or RAM is a/an
27 / 50
Sieve Technique can be applied to selection problem?
28 / 50
Quick sort is best from the perspective of Locality of reference.
29 / 50
In which order we can sort?
30 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
31 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
32 / 50
Efficient algorithm requires less computational…….
33 / 50
34 / 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.
35 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
36 / 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
37 / 50
For the heap sort, access to nodes involves simple _______________ operations.
38 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
39 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
40 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
41 / 50
In simple brute-force algorithm, we give no thought to efficiency.
42 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
43 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
44 / 50
Which sorting algorithm is faster
45 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
46 / 50
What is the total time to heapify?
47 / 50
One example of in place but not stable algorithm is
48 / 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.
49 / 50
In Heap Sort algorithm, if heap property is violated _________
50 / 50
Your score is
The average score is 40%
Restart quiz
