CS502-Midterm
1 / 50
The O-notation is used to state only the asymptotic ________bounds.
2 / 50
In simple brute-force algorithm, we give no thought to efficiency.
3 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
4 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
5 / 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.
6 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
7 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
8 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
9 / 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.
10 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
11 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
12 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
13 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
14 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
15 / 50
Quick sort is best from the perspective of Locality of reference.
16 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
17 / 50
Sorting can be in _________
18 / 50
How much time merge sort takes for an array of numbers?
19 / 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.
20 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
21 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
22 / 50
Analysis of Selection algorithm ends up with,
23 / 50
The number of nodes in a complete binary tree of height h is
24 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
25 / 50
Due to left complete nature of binary tree, the heap can be stored in
26 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
27 / 50
In Sieve Technique we do not know which item is of interest
28 / 50
In which order we can sort?
29 / 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.
30 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
31 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
32 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
33 / 50
For the Sieve Technique we take time
34 / 50
Slow sorting algorithms run in,
35 / 50
For the sieve technique we solve the problem,
36 / 50
A RAM is an idealized machine with ______________ random-access memory.
37 / 50
In Heap Sort algorithm, if heap property is violated _________
38 / 50
39 / 50
One example of in place but not stable algorithm is
40 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
41 / 50
Which may be stable sort:
42 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
43 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
44 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
45 / 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.
46 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
47 / 50
After sorting in merge sort algorithm, merging process is invoked.
48 / 50
The sieve technique works in ___________ as follows
49 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
50 / 50
Algorithm is concerned with.......issues.
Your score is
The average score is 40%
Restart quiz
