CS502-Midterm
1 / 50
Quick sort is best from the perspective of Locality of reference.
2 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
3 / 50
Slow sorting algorithms run in,
4 / 50
Which sorting algorithm is faster
5 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
6 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
7 / 50
For the heap sort we store the tree nodes in
8 / 50
Which may be stable sort:
9 / 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.
10 / 50
How much time merge sort takes for an array of numbers?
11 / 50
A heap is a left-complete binary tree that conforms to the ___________
12 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
13 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
14 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
15 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
16 / 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
17 / 50
Sorting can be in _________
18 / 50
Due to left complete nature of binary tree, the heap can be stored in
19 / 50
In Quick Sort Constants hidden in T(n log n) are
20 / 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.
21 / 50
Algorithm is concerned with.......issues.
22 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
23 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
24 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
25 / 50
The Knapsack problem belongs to the domain of _______________ problems.
26 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
27 / 50
In Sieve Technique we do not know which item is of interest
28 / 50
One Example of in place but not stable sort is
29 / 50
Cont sort is suitable to sort the elements in range 1 to k
30 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
31 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
32 / 50
In Heap Sort algorithm, if heap property is violated _________
33 / 50
After sorting in merge sort algorithm, merging process is invoked.
34 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
35 / 50
For the Sieve Technique we take time
36 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
37 / 50
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
Quick sort is
40 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
41 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
42 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
43 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
44 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
45 / 50
In which order we can sort?
46 / 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.
47 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
48 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
49 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
50 / 50
In RAM model instructions are executed
Your score is
The average score is 40%
Restart quiz
