CS502-Midterm
1 / 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.
2 / 50
In simple brute-force algorithm, we give no thought to efficiency.
3 / 50
When we call heapify then at each level the comparison performed takes time
4 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
5 / 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.
6 / 50
In Sieve Technique we do not know which item is of interest
7 / 50
In ____________ we have to find rank of an element from given input.
8 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
9 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
10 / 50
Which may be a stable sort?
11 / 50
In Quick Sort Constants hidden in T(n log n) are
12 / 50
13 / 50
After sorting in merge sort algorithm, merging process is invoked.
14 / 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.
15 / 50
What is the total time to heapify?
16 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
17 / 50
_______________ is a graphical representation of an algorithm
18 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
19 / 50
A heap is a left-complete binary tree that conforms to the ___________
20 / 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.
21 / 50
For the sieve technique we solve the problem,
22 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
23 / 50
Counting sort has time complexity:
24 / 50
In Heap Sort algorithm, if heap property is violated _________
25 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
26 / 50
The number of nodes in a complete binary tree of height h is
27 / 50
In which order we can sort?
28 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
29 / 50
Which may be stable sort:
30 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
31 / 50
The O-notation is used to state only the asymptotic ________bounds.
32 / 50
The Knapsack problem belongs to the domain of _______________ problems.
33 / 50
Random access machine or RAM is a/an
34 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
35 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
36 / 50
______________ graphical representation of algorithm.
37 / 50
How much time merge sort takes for an array of numbers?
38 / 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.
39 / 50
40 / 50
What type of instructions Random Access Machine (RAM) can execute?
41 / 50
In RAM model instructions are executed
42 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
43 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
44 / 50
Sieve Technique can be applied to selection problem?
45 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
46 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
47 / 50
One example of in place but not stable algorithm is
48 / 50
Cont sort is suitable to sort the elements in range 1 to k
49 / 50
Analysis of Selection algorithm ends up with,
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
