CS502-Midterm
1 / 50
Analysis of Selection algorithm ends up with,
2 / 50
______________ graphical representation of algorithm.
3 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
4 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
5 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
6 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
7 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
8 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
9 / 50
When we call heapify then at each level the comparison performed takes time
10 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
11 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
12 / 50
In Quick Sort Constants hidden in T(n log n) are
13 / 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.
14 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
15 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
16 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
17 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
18 / 50
After sorting in merge sort algorithm, merging process is invoked.
19 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
20 / 50
Which may be stable sort:
21 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
22 / 50
Which may be a stable sort?
23 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
24 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
25 / 50
Quick sort is
26 / 50
In Sieve Technique we do not know which item is of interest
27 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
28 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
29 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
30 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
31 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
32 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
33 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
34 / 50
The sieve technique works in ___________ as follows
35 / 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.
36 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
37 / 50
One Example of in place but not stable sort is
38 / 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.
39 / 50
The O-notation is used to state only the asymptotic ________bounds.
40 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
41 / 50
What is the total time to heapify?
42 / 50
For the Sieve Technique we take time
43 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
44 / 50
What type of instructions Random Access Machine (RAM) can execute?
45 / 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.
46 / 50
A heap is a left-complete binary tree that conforms to the ___________
47 / 50
For the heap sort, access to nodes involves simple _______________ operations.
48 / 50
49 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
50 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
Your score is
The average score is 40%
Restart quiz
