CS502-Midterm
1 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
2 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
3 / 50
When we call heapify then at each level the comparison performed takes time
4 / 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.
5 / 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.
6 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
7 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
8 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
9 / 50
One example of in place but not stable algorithm is
10 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
11 / 50
12 / 50
A heap is a left-complete binary tree that conforms to the ___________
13 / 50
In which order we can sort?
14 / 50
In Sieve Technique we do not know which item is of interest
15 / 50
One Example of in place but not stable sort is
16 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
17 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
18 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
19 / 50
Analysis of Selection algorithm ends up with,
20 / 50
For the sieve technique we solve the problem,
21 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
22 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
23 / 50
For the Sieve Technique we take time
24 / 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.
25 / 50
Which may be stable sort:
26 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
27 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
28 / 50
What is the total time to heapify?
29 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
30 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
31 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
32 / 50
In ____________ we have to find rank of an element from given input.
33 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
34 / 50
The O-notation is used to state only the asymptotic ________bounds.
35 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
36 / 50
Divide-and-conquer as breaking the problem into a small number of
37 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
38 / 50
The Knapsack problem belongs to the domain of _______________ problems.
39 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
40 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
41 / 50
Quick sort is
42 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
43 / 50
A RAM is an idealized machine with ______________ random-access memory.
44 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
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
What is the solution to the recurrence T(n) = T(n/2)+n .
47 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
48 / 50
What type of instructions Random Access Machine (RAM) can execute?
49 / 50
In Heap Sort algorithm, if heap property is violated _________
50 / 50
______________ graphical representation of algorithm.
Your score is
The average score is 40%
Restart quiz
