CS502-Midterm
1 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
2 / 50
Cont sort is suitable to sort the elements in range 1 to k
3 / 50
In Quick Sort Constants hidden in T(n log n) are
4 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
5 / 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.
6 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
7 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
8 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
9 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
10 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
11 / 50
What is the total time to heapify?
12 / 50
When we call heapify then at each level the comparison performed takes time
13 / 50
For the heap sort, access to nodes involves simple _______________ operations.
14 / 50
Quick sort is
15 / 50
In Sieve Technique we do not know which item is of interest
16 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
17 / 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.
18 / 50
The O-notation is used to state only the asymptotic ________bounds.
19 / 50
A RAM is an idealized machine with ______________ random-access memory.
20 / 50
Divide-and-conquer as breaking the problem into a small number of
21 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
22 / 50
The sieve technique works in ___________ as follows
23 / 50
In simple brute-force algorithm, we give no thought to efficiency.
24 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
25 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
26 / 50
For the Sieve Technique we take time
27 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
28 / 50
In RAM model instructions are executed
29 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
30 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
31 / 50
Counting sort has time complexity:
32 / 50
The Knapsack problem belongs to the domain of _______________ problems.
33 / 50
34 / 50
35 / 50
Quick sort is best from the perspective of Locality of reference.
36 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
37 / 50
In which order we can sort?
38 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
39 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
40 / 50
In Heap Sort algorithm, if heap property is violated _________
41 / 50
For the heap sort we store the tree nodes in
42 / 50
The number of nodes in a complete binary tree of height h is
43 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
44 / 50
In ____________ we have to find rank of an element from given input.
45 / 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.
46 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
47 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
48 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
49 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
50 / 50
Your score is
The average score is 40%
Restart quiz
