CS502-Midterm
1 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
2 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
3 / 50
The running time of quick sort depends heavily on the selection of
4 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
5 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
6 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
7 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
8 / 50
Due to left complete nature of binary tree, the heap can be stored in
9 / 50
For the sieve technique we solve the problem,
10 / 50
Quick sort is best from the perspective of Locality of reference.
11 / 50
What is the total time to heapify?
12 / 50
The sieve technique works in ___________ as follows
13 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
14 / 50
In RAM model instructions are executed
15 / 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.
16 / 50
In which order we can sort?
17 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
18 / 50
Sorting can be in _________
19 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
20 / 50
Divide-and-conquer as breaking the problem into a small number of
21 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
22 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
23 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
24 / 50
In ____________ we have to find rank of an element from given input.
25 / 50
The number of nodes in a complete binary tree of height h is
26 / 50
Which sorting algorithm is faster
27 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
28 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
29 / 50
The sieve technique is a special case, where the number of sub problems is just
30 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
31 / 50
In Sieve Technique we do not know which item is of interest
32 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
33 / 50
For the heap sort we store the tree nodes in
34 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
35 / 50
Algorithm is concerned with.......issues.
36 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
37 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
38 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
39 / 50
For the Sieve Technique we take time
40 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
41 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
42 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
43 / 50
After sorting in merge sort algorithm, merging process is invoked.
44 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
45 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
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
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.
48 / 50
A heap is a left-complete binary tree that conforms to the ___________
49 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
50 / 50
Quick sort is
Your score is
The average score is 40%
Restart quiz
