CS502-Midterm
1 / 50
Due to left complete nature of binary tree, the heap can be stored in
2 / 50
______________ graphical representation of algorithm.
3 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
4 / 50
In Sieve Technique we do not know which item is of interest
5 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
6 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
7 / 50
In simple brute-force algorithm, we give no thought to efficiency.
8 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
9 / 50
Efficient algorithm requires less computational…….
10 / 50
How much time merge sort takes for an array of numbers?
11 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
12 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
13 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
14 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
15 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
16 / 50
17 / 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.
18 / 50
Slow sorting algorithms run in,
19 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
20 / 50
Which may be a stable sort?
21 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
22 / 50
A RAM is an idealized machine with ______________ random-access memory.
23 / 50
For the Sieve Technique we take time
24 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
25 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
26 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
27 / 50
Quick sort is
28 / 50
One Example of in place but not stable sort is
29 / 50
The running time of quick sort depends heavily on the selection of
30 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
31 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
32 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
33 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
34 / 50
A heap is a left-complete binary tree that conforms to the ___________
35 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
36 / 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.
37 / 50
For the heap sort, access to nodes involves simple _______________ operations.
38 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
39 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
40 / 50
In ____________ we have to find rank of an element from given input.
41 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
42 / 50
Random access machine or RAM is a/an
43 / 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.
44 / 50
In Quick Sort Constants hidden in T(n log n) are
45 / 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.
46 / 50
Sorting can be in _________
47 / 50
48 / 50
49 / 50
_______________ is a graphical representation of an algorithm
50 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
Your score is
The average score is 40%
Restart quiz
