CS502-Midterm
1 / 50
Divide-and-conquer as breaking the problem into a small number of
2 / 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.
3 / 50
When we call heapify then at each level the comparison performed takes time
4 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
5 / 50
Counting sort has time complexity:
6 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
7 / 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.
8 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
9 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
10 / 50
After sorting in merge sort algorithm, merging process is invoked.
11 / 50
In Quick Sort Constants hidden in T(n log n) are
12 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
13 / 50
What type of instructions Random Access Machine (RAM) can execute?
14 / 50
In RAM model instructions are executed
15 / 50
Random access machine or RAM is a/an
16 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
17 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
18 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
19 / 50
For the worst-case running time analysis, the nested loop structure containing one “for” and one “while” loop, might be expressed as a pair of _________nested summations.
20 / 50
The running time of quick sort depends heavily on the selection of
21 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
22 / 50
Analysis of Selection algorithm ends up with,
23 / 50
Due to left complete nature of binary tree, the heap can be stored in
24 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
25 / 50
What is the total time to heapify?
26 / 50
Sorting can be in _________
27 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
28 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
29 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
30 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
31 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
32 / 50
For the Sieve Technique we take time
33 / 50
34 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
35 / 50
Which sorting algorithm is faster
36 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
37 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
38 / 50
In simple brute-force algorithm, we give no thought to efficiency.
39 / 50
In Heap Sort algorithm, if heap property is violated _________
40 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
41 / 50
In Sieve Technique we do not know which item is of interest
42 / 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.
43 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
44 / 50
45 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
46 / 50
How much time merge sort takes for an array of numbers?
47 / 50
The sieve technique is a special case, where the number of sub problems is just
48 / 50
Cont sort is suitable to sort the elements in range 1 to k
49 / 50
50 / 50
A RAM is an idealized machine with ______________ random-access memory.
Your score is
The average score is 40%
Restart quiz
