CS502-Midterm
1 / 50
In Sieve Technique we do not know which item is of interest
2 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
3 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
4 / 50
5 / 50
For the heap sort, access to nodes involves simple _______________ operations.
6 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
7 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
8 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
9 / 50
What is the total time to heapify?
10 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
11 / 50
Sorting can be in _________
12 / 50
For the sieve technique we solve the problem,
13 / 50
Analysis of Selection algorithm ends up with,
14 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
15 / 50
A heap is a left-complete binary tree that conforms to the ___________
16 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
17 / 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.
18 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
19 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
20 / 50
Cont sort is suitable to sort the elements in range 1 to k
21 / 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.
22 / 50
Sieve Technique can be applied to selection problem?
23 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
24 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
25 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
26 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
27 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
28 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
29 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
30 / 50
Is it possible to sort without making comparisons?
31 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
32 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
33 / 50
In which order we can sort?
34 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
35 / 50
The Knapsack problem belongs to the domain of _______________ problems.
36 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
37 / 50
38 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
39 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
40 / 50
Slow sorting algorithms run in,
41 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
42 / 50
_______________ is a graphical representation of an algorithm
43 / 50
______________ graphical representation of algorithm.
44 / 50
One example of in place but not stable algorithm is
45 / 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.
46 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
47 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
48 / 50
In Quick Sort Constants hidden in T(n log n) are
49 / 50
Random access machine or RAM is a/an
50 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
Your score is
The average score is 40%
Restart quiz
