CS502-Midterm
1 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
2 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
3 / 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.
4 / 50
After sorting in merge sort algorithm, merging process is invoked.
5 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
6 / 50
Sorting can be in _________
7 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
8 / 50
Which sorting algorithm is faster
9 / 50
One example of in place but not stable algorithm is
10 / 50
Which may be a stable sort?
11 / 50
For the heap sort, access to nodes involves simple _______________ operations.
12 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
13 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
14 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
15 / 50
In which order we can sort?
16 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
17 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
18 / 50
What is the total time to heapify?
19 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
20 / 50
What type of instructions Random Access Machine (RAM) can execute?
21 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
22 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
23 / 50
The sieve technique is a special case, where the number of sub problems is just
24 / 50
______________ graphical representation of algorithm.
25 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
26 / 50
27 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
28 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
29 / 50
In RAM model instructions are executed
30 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
31 / 50
In ____________ we have to find rank of an element from given input.
32 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
33 / 50
Is it possible to sort without making comparisons?
34 / 50
The number of nodes in a complete binary tree of height h is
35 / 50
Efficient algorithm requires less computational…….
36 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
37 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
38 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
39 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
40 / 50
In Sieve Technique we do not know which item is of interest
41 / 50
Cont sort is suitable to sort the elements in range 1 to k
42 / 50
43 / 50
Quick sort is
44 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
45 / 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.
46 / 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.
47 / 50
48 / 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.
49 / 50
Sieve Technique can be applied to selection problem?
50 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
Your score is
The average score is 40%
Restart quiz
