CS502-Midterm
1 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
2 / 50
A heap is a left-complete binary tree that conforms to the ___________
3 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
4 / 50
Slow sorting algorithms run in,
5 / 50
In ____________ we have to find rank of an element from given input.
6 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
7 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
8 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
9 / 50
The Knapsack problem belongs to the domain of _______________ problems.
10 / 50
When we call heapify then at each level the comparison performed takes time
11 / 50
In Sieve Technique we do not know which item is of interest
12 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
13 / 50
What is the total time to heapify?
14 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
15 / 50
Cont sort is suitable to sort the elements in range 1 to k
16 / 50
In Quick Sort Constants hidden in T(n log n) are
17 / 50
Sorting can be in _________
18 / 50
In Heap Sort algorithm, if heap property is violated _________
19 / 50
In which order we can sort?
20 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
21 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
22 / 50
In RAM model instructions are executed
23 / 50
24 / 50
The running time of quick sort depends heavily on the selection of
25 / 50
26 / 50
Which may be stable sort:
27 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
28 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
29 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
30 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
31 / 50
32 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
33 / 50
In simple brute-force algorithm, we give no thought to efficiency.
34 / 50
For the sieve technique we solve the problem,
35 / 50
Is it possible to sort without making comparisons?
36 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
37 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
38 / 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.
39 / 50
The sieve technique is a special case, where the number of sub problems is just
40 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
41 / 50
Which may be a stable sort?
42 / 50
Analysis of Selection algorithm ends up with,
43 / 50
For the Sieve Technique we take time
44 / 50
Divide-and-conquer as breaking the problem into a small number of
45 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
46 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
47 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
48 / 50
_______________ is a graphical representation of an algorithm
49 / 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.
50 / 50
How much time merge sort takes for an array of numbers?
Your score is
The average score is 40%
Restart quiz
