CS502-Midterm
1 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
2 / 50
In which order we can sort?
3 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
4 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
5 / 50
Analysis of Selection algorithm ends up with,
6 / 50
Counting sort has time complexity:
7 / 50
_______________ is a graphical representation of an algorithm
8 / 50
The running time of quick sort depends heavily on the selection of
9 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
10 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
11 / 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.
12 / 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.
13 / 50
When we call heapify then at each level the comparison performed takes time
14 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
15 / 50
In ____________ we have to find rank of an element from given input.
16 / 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.
17 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
18 / 50
Due to left complete nature of binary tree, the heap can be stored in
19 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
20 / 50
Cont sort is suitable to sort the elements in range 1 to k
21 / 50
In Sieve Technique we do not know which item is of interest
22 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
23 / 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,
24 / 50
A heap is a left-complete binary tree that conforms to the ___________
25 / 50
Is it possible to sort without making comparisons?
26 / 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.
27 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
28 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
29 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
30 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
31 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
32 / 50
Which sorting algorithm is faster
33 / 50
Which may be a stable sort?
34 / 50
35 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
36 / 50
Sorting can be in _________
37 / 50
One Example of in place but not stable sort is
38 / 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.
39 / 50
For the heap sort we store the tree nodes in
40 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
41 / 50
The sieve technique works in ___________ as follows
42 / 50
A RAM is an idealized machine with ______________ random-access memory.
43 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
44 / 50
In Quick Sort Constants hidden in T(n log n) are
45 / 50
In Heap Sort algorithm, if heap property is violated _________
46 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
47 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
48 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
49 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
50 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
Your score is
The average score is 40%
Restart quiz
