CS502-Midterm
1 / 50
After sorting in merge sort algorithm, merging process is invoked.
2 / 50
How much time merge sort takes for an array of numbers?
3 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
4 / 50
In ____________ we have to find rank of an element from given input.
5 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
6 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
7 / 50
Analysis of Selection algorithm ends up with,
8 / 50
One example of in place but not stable algorithm is
9 / 50
The Knapsack problem belongs to the domain of _______________ problems.
10 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
11 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
12 / 50
______________ graphical representation of algorithm.
13 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
14 / 50
In RAM model instructions are executed
15 / 50
In Sieve Technique we do not know which item is of interest
16 / 50
In Quick Sort Constants hidden in T(n log n) are
17 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
18 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
19 / 50
Sieve Technique can be applied to selection problem?
20 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
21 / 50
Slow sorting algorithms run in,
22 / 50
Which may be stable sort:
23 / 50
Counting sort has time complexity:
24 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
25 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
26 / 50
27 / 50
What is the total time to heapify?
28 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
29 / 50
A heap is a left-complete binary tree that conforms to the ___________
30 / 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.
31 / 50
What type of instructions Random Access Machine (RAM) can execute?
32 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
33 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
34 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
35 / 50
When we call heapify then at each level the comparison performed takes time
36 / 50
37 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
38 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
39 / 50
For the heap sort, access to nodes involves simple _______________ operations.
40 / 50
One Example of in place but not stable sort is
41 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
42 / 50
Random access machine or RAM is a/an
43 / 50
44 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
45 / 50
Is it possible to sort without making comparisons?
46 / 50
The O-notation is used to state only the asymptotic ________bounds.
47 / 50
48 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
49 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
50 / 50
The sieve technique is a special case, where the number of sub problems is just
Your score is
The average score is 40%
Restart quiz
