CS502-Midterm
1 / 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.
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
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
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
When we call heapify then at each level the comparison performed takes time
6 / 50
In Heap Sort algorithm, if heap property is violated _________
7 / 50
Divide-and-conquer as breaking the problem into a small number of
8 / 50
In Sieve Technique we do not know which item is of interest
9 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
10 / 50
Algorithm is concerned with.......issues.
11 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
12 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
13 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
14 / 50
A heap is a left-complete binary tree that conforms to the ___________
15 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
16 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
17 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
18 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
19 / 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.
20 / 50
The number of nodes in a complete binary tree of height h is
21 / 50
The O-notation is used to state only the asymptotic ________bounds.
22 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
23 / 50
One example of in place but not stable algorithm is
24 / 50
The running time of quick sort depends heavily on the selection of
25 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
26 / 50
What is the total time to heapify?
27 / 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.
28 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
29 / 50
Which sorting algorithm is faster
30 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
31 / 50
32 / 50
Sorting can be in _________
33 / 50
For the Sieve Technique we take time
34 / 50
In which order we can sort?
35 / 50
36 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
37 / 50
Due to left complete nature of binary tree, the heap can be stored in
38 / 50
Efficient algorithm requires less computational…….
39 / 50
One Example of in place but not stable sort is
40 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
41 / 50
In Quick Sort Constants hidden in T(n log n) are
42 / 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.
43 / 50
Which may be stable sort:
44 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
45 / 50
Sieve Technique can be applied to selection problem?
46 / 50
For the heap sort we store the tree nodes in
47 / 50
48 / 50
_______________ is a graphical representation of an algorithm
49 / 50
The sieve technique works in ___________ as follows
50 / 50
How much time merge sort takes for an array of numbers?
Your score is
The average score is 40%
Restart quiz
