CS502-Midterm
1 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
2 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
3 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
4 / 50
The Knapsack problem belongs to the domain of _______________ problems.
5 / 50
For the heap sort we store the tree nodes in
6 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
7 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
8 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
9 / 50
Sorting can be in _________
10 / 50
Algorithm is concerned with.......issues.
11 / 50
What is the total time to heapify?
12 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
13 / 50
After sorting in merge sort algorithm, merging process is invoked.
14 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
15 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
16 / 50
One Example of in place but not stable sort is
17 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
18 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
19 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
20 / 50
Divide-and-conquer as breaking the problem into a small number of
21 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
22 / 50
A heap is a left-complete binary tree that conforms to the ___________
23 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
24 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
25 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
26 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
27 / 50
Slow sorting algorithms run in,
28 / 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.
29 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
30 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
31 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
32 / 50
In Quick Sort Constants hidden in T(n log n) are
33 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
34 / 50
Is it possible to sort without making comparisons?
35 / 50
Counting sort has time complexity:
36 / 50
Which may be a stable sort?
37 / 50
In ____________ we have to find rank of an element from given input.
38 / 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.
39 / 50
In Sieve Technique we do not know which item is of interest
40 / 50
For the Sieve Technique we take time
41 / 50
Which sorting algorithm is faster
42 / 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,
43 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
44 / 50
The running time of quick sort depends heavily on the selection of
45 / 50
Sieve Technique can be applied to selection problem?
46 / 50
For the worst-case running time analysis, the nested loop structure containing one “for” and one “while” loop, might be expressed as a pair of _________nested summations.
47 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
48 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
49 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
50 / 50
Your score is
The average score is 40%
Restart quiz
