CS502-Midterm
1 / 50
When we call heapify then at each level the comparison performed takes time
2 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
3 / 50
In Quick Sort Constants hidden in T(n log n) are
4 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
5 / 50
For the Sieve Technique we take time
6 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
7 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
8 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
9 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
10 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
11 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
12 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
13 / 50
How much time merge sort takes for an array of numbers?
14 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
15 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
16 / 50
The number of nodes in a complete binary tree of height h is
17 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
18 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
19 / 50
Counting sort has time complexity:
20 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
21 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
22 / 50
______________ graphical representation of algorithm.
23 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
24 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
25 / 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.
26 / 50
In Heap Sort algorithm, if heap property is violated _________
27 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
28 / 50
29 / 50
30 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
31 / 50
Quick sort is best from the perspective of Locality of reference.
32 / 50
One Example of in place but not stable sort is
33 / 50
In simple brute-force algorithm, we give no thought to efficiency.
34 / 50
The O-notation is used to state only the asymptotic ________bounds.
35 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
36 / 50
For the heap sort we store the tree nodes in
37 / 50
The running time of quick sort depends heavily on the selection of
38 / 50
In Sieve Technique we do not know which item is of interest
39 / 50
In the analysis of Selection algorithm, we eliminate a constant fraction of the array with each phase; we get the convergent _______________ series in the analysis,
40 / 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.
41 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
42 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
43 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
44 / 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.
45 / 50
For the heap sort, access to nodes involves simple _______________ operations.
46 / 50
Which sorting algorithm is faster
47 / 50
The sieve technique is a special case, where the number of sub problems is just
48 / 50
49 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
50 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
Your score is
The average score is 40%
Restart quiz
