CS502-Midterm
1 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
2 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
3 / 50
What is the total time to heapify?
4 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
5 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
6 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
7 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
8 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
9 / 50
In Sieve Technique we do not know which item is of interest
10 / 50
The Knapsack problem belongs to the domain of _______________ problems.
11 / 50
The running time of quick sort depends heavily on the selection of
12 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
13 / 50
For the Sieve Technique we take time
14 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
15 / 50
16 / 50
Due to left complete nature of binary tree, the heap can be stored in
17 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
18 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
19 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
20 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
21 / 50
How much time merge sort takes for an array of numbers?
22 / 50
23 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
24 / 50
The sieve technique works in ___________ as follows
25 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
26 / 50
Slow sorting algorithms run in,
27 / 50
Analysis of Selection algorithm ends up with,
28 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
29 / 50
After sorting in merge sort algorithm, merging process is invoked.
30 / 50
Counting sort has time complexity:
31 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
32 / 50
In RAM model instructions are executed
33 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
34 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
35 / 50
In which order we can sort?
36 / 50
Sieve Technique can be applied to selection problem?
37 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
38 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
39 / 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.
40 / 50
Which may be a stable sort?
41 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
42 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
43 / 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.
44 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
45 / 50
Quick sort is
46 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
47 / 50
A RAM is an idealized machine with ______________ random-access memory.
48 / 50
For the sieve technique we solve the problem,
49 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
50 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
Your score is
The average score is 40%
Restart quiz
