CS502-Midterm
1 / 50
Analysis of Selection algorithm ends up with,
2 / 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.
3 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
4 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
5 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
6 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
7 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
8 / 50
Divide-and-conquer as breaking the problem into a small number of
9 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
10 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
11 / 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.
12 / 50
In Sieve Technique we do not know which item is of interest
13 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
14 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
15 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
16 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
17 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
18 / 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.
19 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
20 / 50
The O-notation is used to state only the asymptotic ________bounds.
21 / 50
In Quick Sort Constants hidden in T(n log n) are
22 / 50
A RAM is an idealized machine with ______________ random-access memory.
23 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
24 / 50
A heap is a left-complete binary tree that conforms to the ___________
25 / 50
How much time merge sort takes for an array of numbers?
26 / 50
In RAM model instructions are executed
27 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
28 / 50
For the Sieve Technique we take time
29 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
30 / 50
31 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
32 / 50
33 / 50
In the analysis of Selection algorithm, we eliminate a constant fraction of the array with each phase; we get the convergent _______________ series in the analysis,
34 / 50
For the heap sort we store the tree nodes in
35 / 50
The running time of quick sort depends heavily on the selection of
36 / 50
The number of nodes in a complete binary tree of height h is
37 / 50
After sorting in merge sort algorithm, merging process is invoked.
38 / 50
Slow sorting algorithms run in,
39 / 50
The Knapsack problem belongs to the domain of _______________ problems.
40 / 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.
41 / 50
The sieve technique is a special case, where the number of sub problems is just
42 / 50
Quick sort is
43 / 50
Algorithm is concerned with.......issues.
44 / 50
Which may be a stable sort?
45 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
46 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
47 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
48 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
49 / 50
Quick sort is best from the perspective of Locality of reference.
50 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
Your score is
The average score is 40%
Restart quiz
