CS502-Midterm
1 / 50
In Heap Sort algorithm, if heap property is violated _________
2 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
3 / 50
Which may be a stable sort?
4 / 50
Sieve Technique can be applied to selection problem?
5 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
6 / 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.
7 / 50
Due to left complete nature of binary tree, the heap can be stored in
8 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
9 / 50
In Sieve Technique we do not know which item is of interest
10 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
11 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
12 / 50
For the Sieve Technique we take time
13 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
14 / 50
For the heap sort, access to nodes involves simple _______________ operations.
15 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
16 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
17 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
18 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
19 / 50
In Quick Sort Constants hidden in T(n log n) are
20 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
21 / 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.
22 / 50
When we call heapify then at each level the comparison performed takes time
23 / 50
Algorithm is concerned with.......issues.
24 / 50
25 / 50
26 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
27 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
28 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
29 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
30 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
31 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
32 / 50
______________ graphical representation of algorithm.
33 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
34 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
35 / 50
Divide-and-conquer as breaking the problem into a small number of
36 / 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,
37 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
38 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
39 / 50
Consider the following code:
For(j=1; j
For(k=1; k<15;k++)
For(l=5; l
{
Do_something_constant();
}
What is the order of execution for this code.
40 / 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.
41 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
42 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
43 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
44 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
45 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
46 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
47 / 50
For the heap sort we store the tree nodes in
48 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
49 / 50
In simple brute-force algorithm, we give no thought to efficiency.
50 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
Your score is
The average score is 40%
Restart quiz
