CS502-Midterm
1 / 50
Which sorting algorithm is faster
2 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
3 / 50
In simple brute-force algorithm, we give no thought to efficiency.
4 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
5 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
6 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
7 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
8 / 50
The Knapsack problem belongs to the domain of _______________ problems.
9 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
10 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
11 / 50
In Sieve Technique we do not know which item is of interest
12 / 50
Which may be a stable sort?
13 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
14 / 50
Quick sort is
15 / 50
Which may be stable sort:
16 / 50
One Example of in place but not stable sort is
17 / 50
A heap is a left-complete binary tree that conforms to the ___________
18 / 50
For the heap sort, access to nodes involves simple _______________ operations.
19 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
20 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
21 / 50
Efficient algorithm requires less computational…….
22 / 50
The O-notation is used to state only the asymptotic ________bounds.
23 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
24 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
25 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
26 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
27 / 50
The running time of quick sort depends heavily on the selection of
28 / 50
What is the total time to heapify?
29 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
30 / 50
31 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
32 / 50
Algorithm is concerned with.......issues.
33 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
34 / 50
Counting sort has time complexity:
35 / 50
In ____________ we have to find rank of an element from given input.
36 / 50
In Quick Sort Constants hidden in T(n log n) are
37 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
38 / 50
After sorting in merge sort algorithm, merging process is invoked.
39 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
40 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
41 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
42 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
43 / 50
A RAM is an idealized machine with ______________ random-access memory.
44 / 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.
45 / 50
In which order we can sort?
46 / 50
For the heap sort we store the tree nodes in
47 / 50
48 / 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.
49 / 50
One example of in place but not stable algorithm is
50 / 50
In Heap Sort algorithm, if heap property is violated _________
Your score is
The average score is 40%
Restart quiz
