CS502-Midterm
1 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
2 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
3 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
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
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
6 / 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.
7 / 50
Which may be a stable sort?
8 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
9 / 50
Sorting can be in _________
10 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
11 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
12 / 50
Efficient algorithm requires less computational…….
13 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
14 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
15 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
16 / 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.
17 / 50
Which sorting algorithm is faster
18 / 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.
19 / 50
When we call heapify then at each level the comparison performed takes time
20 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
21 / 50
The number of nodes in a complete binary tree of height h is
22 / 50
For the Sieve Technique we take time
23 / 50
In Sieve Technique we do not know which item is of interest
24 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
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
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.
27 / 50
The Knapsack problem belongs to the domain of _______________ problems.
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
One example of in place but not stable algorithm is
30 / 50
31 / 50
In simple brute-force algorithm, we give no thought to efficiency.
32 / 50
For the heap sort, access to nodes involves simple _______________ operations.
33 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
34 / 50
Slow sorting algorithms run in,
35 / 50
After sorting in merge sort algorithm, merging process is invoked.
36 / 50
Algorithm is concerned with.......issues.
37 / 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.
38 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
39 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
40 / 50
In Heap Sort algorithm, if heap property is violated _________
41 / 50
Sieve Technique can be applied to selection problem?
42 / 50
For the heap sort we store the tree nodes in
43 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
44 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
45 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
46 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
47 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
48 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
49 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
50 / 50
What is the total time to heapify?
Your score is
The average score is 40%
Restart quiz
