CS502-Midterm
1 / 50
What is the total time to heapify?
2 / 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.
3 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
4 / 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.
5 / 50
The Knapsack problem belongs to the domain of _______________ problems.
6 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
7 / 50
In Sieve Technique we do not know which item is of interest
8 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
9 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
10 / 50
11 / 50
Quick sort is best from the perspective of Locality of reference.
12 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
13 / 50
For the Sieve Technique we take time
14 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
15 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
16 / 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.
17 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
18 / 50
How much time merge sort takes for an array of numbers?
19 / 50
Quick sort is
20 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
21 / 50
Upper bound requires that there exist positive constants c2 and n0 such that f(n) ____ c2n for all n <= n0(ye question ghalat lag raha hai mujhae
22 / 50
Is it possible to sort without making comparisons?
23 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
24 / 50
25 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
26 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
27 / 50
The running time of quick sort depends heavily on the selection of
28 / 50
In RAM model instructions are executed
29 / 50
30 / 50
31 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
32 / 50
After sorting in merge sort algorithm, merging process is invoked.
33 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
34 / 50
Sorting can be in _________
35 / 50
In simple brute-force algorithm, we give no thought to efficiency.
36 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
37 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
38 / 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.
39 / 50
_______________ is a graphical representation of an algorithm
40 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
41 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
42 / 50
43 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
44 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
45 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
46 / 50
Due to left complete nature of binary tree, the heap can be stored in
47 / 50
______________ graphical representation of algorithm.
48 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
49 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
50 / 50
The O-notation is used to state only the asymptotic ________bounds.
Your score is
The average score is 40%
Restart quiz
