CS502-Midterm
1 / 50
When we call heapify then at each level the comparison performed takes time
2 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
3 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
4 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
5 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
6 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
7 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
8 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
9 / 50
A heap is a left-complete binary tree that conforms to the ___________
10 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
11 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
12 / 50
Which sorting algorithm is faster
13 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
14 / 50
Is it possible to sort without making comparisons?
15 / 50
One Example of in place but not stable sort is
16 / 50
For the sieve technique we solve the problem,
17 / 50
In Sieve Technique we do not know which item is of interest
18 / 50
In which order we can sort?
19 / 50
What type of instructions Random Access Machine (RAM) can execute?
20 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
21 / 50
The sieve technique works in ___________ as follows
22 / 50
After sorting in merge sort algorithm, merging process is invoked.
23 / 50
How much time merge sort takes for an array of numbers?
24 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
25 / 50
Sorting can be in _________
26 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
27 / 50
In Quick Sort Constants hidden in T(n log n) are
28 / 50
Counting sort has time complexity:
29 / 50
The Knapsack problem belongs to the domain of _______________ problems.
30 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
31 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
32 / 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
33 / 50
Sieve Technique can be applied to selection problem?
34 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
35 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
36 / 50
A RAM is an idealized machine with ______________ random-access memory.
37 / 50
What is the total time to heapify?
38 / 50
The number of nodes in a complete binary tree of height h is
39 / 50
Which may be stable sort:
40 / 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.
41 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
42 / 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.
43 / 50
Which may be a stable sort?
44 / 50
The O-notation is used to state only the asymptotic ________bounds.
45 / 50
Quick sort is
46 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
47 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
48 / 50
49 / 50
Algorithm is concerned with.......issues.
50 / 50
Quick sort is best from the perspective of Locality of reference.
Your score is
The average score is 40%
Restart quiz
