CS502-Midterm
1 / 50
Sorting can be in _________
2 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
3 / 50
Is it possible to sort without making comparisons?
4 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
5 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
6 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
7 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
8 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
9 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
10 / 50
A heap is a left-complete binary tree that conforms to the ___________
11 / 50
Sieve Technique can be applied to selection problem?
12 / 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.
13 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
14 / 50
One Example of in place but not stable sort is
15 / 50
For the sieve technique we solve the problem,
16 / 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.
17 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
18 / 50
For the Sieve Technique we take time
19 / 50
One example of in place but not stable algorithm is
20 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
21 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
22 / 50
Consider the following code:
For(j=1; j
For(k=1; k<15;k++)
For(l=5; l
{
Do_something_constant();
}
What is the order of execution for this code.
23 / 50
In Quick Sort Constants hidden in T(n log n) are
24 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
25 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
26 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
27 / 50
The number of nodes in a complete binary tree of height h is
28 / 50
After sorting in merge sort algorithm, merging process is invoked.
29 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
30 / 50
Efficient algorithm requires less computational…….
31 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
32 / 50
How much time merge sort takes for an array of numbers?
33 / 50
The Knapsack problem belongs to the domain of _______________ problems.
34 / 50
35 / 50
Which sorting algorithm is faster
36 / 50
Counting sort has time complexity:
37 / 50
The O-notation is used to state only the asymptotic ________bounds.
38 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
39 / 50
The sieve technique is a special case, where the number of sub problems is just
40 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
41 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
42 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
43 / 50
44.The running time of an algorithm would not depend upon the optimization by the compiler but that of an implementation of the algorithm would depend on it.
44 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
45 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
46 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
47 / 50
The running time of quick sort depends heavily on the selection of
48 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
49 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
50 / 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.
Your score is
The average score is 40%
Restart quiz
