CS502-Midterm
1 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
2 / 50
In which order we can sort?
3 / 50
In ____________ we have to find rank of an element from given input.
4 / 50
Efficient algorithm requires less computational…….
5 / 50
In Heap Sort algorithm, if heap property is violated _________
6 / 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.
7 / 50
Slow sorting algorithms run in,
8 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
9 / 50
For the heap sort, access to nodes involves simple _______________ operations.
10 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
11 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
12 / 50
One example of in place but not stable algorithm is
13 / 50
Which sorting algorithm is faster
14 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
15 / 50
What is the total time to heapify?
16 / 50
In Sieve Technique we do not know which item is of interest
17 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
18 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
19 / 50
Sieve Technique can be applied to selection problem?
20 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
21 / 50
In RAM model instructions are executed
22 / 50
The Knapsack problem belongs to the domain of _______________ problems.
23 / 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.
24 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
25 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
26 / 50
A RAM is an idealized machine with ______________ random-access memory.
27 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
28 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
29 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
30 / 50
Counting sort has time complexity:
31 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
32 / 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.
33 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
34 / 50
The sieve technique works in ___________ as follows
35 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
36 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
37 / 50
______________ graphical representation of algorithm.
38 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
39 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
40 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
41 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
42 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
43 / 50
Random access machine or RAM is a/an
44 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
45 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
46 / 50
Which may be a stable sort?
47 / 50
What type of instructions Random Access Machine (RAM) can execute?
48 / 50
For the Sieve Technique we take time
49 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
50 / 50
Divide-and-conquer as breaking the problem into a small number of
Your score is
The average score is 40%
Restart quiz
