CS502-Midterm
1 / 50
The Knapsack problem belongs to the domain of _______________ problems.
2 / 50
When we call heapify then at each level the comparison performed takes time
3 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
4 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
5 / 50
In Sieve Technique we do not know which item is of interest
6 / 50
One example of in place but not stable algorithm is
7 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
8 / 50
Which sorting algorithm is faster
9 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
10 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
11 / 50
For the sieve technique we solve the problem,
12 / 50
Quick sort is best from the perspective of Locality of reference.
13 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
14 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
15 / 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.
16 / 50
The running time of quick sort depends heavily on the selection of
17 / 50
Is it possible to sort without making comparisons?
18 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
19 / 50
Algorithm is concerned with.......issues.
20 / 50
One Example of in place but not stable sort is
21 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
22 / 50
In simple brute-force algorithm, we give no thought to efficiency.
23 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
24 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
25 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
26 / 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.
27 / 50
What type of instructions Random Access Machine (RAM) can execute?
28 / 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
29 / 50
How much time merge sort takes for an array of numbers?
30 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
31 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
32 / 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.
33 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
34 / 50
For the Sieve Technique we take time
35 / 50
Which may be a stable sort?
36 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
37 / 50
For the heap sort we store the tree nodes in
38 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
39 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
40 / 50
Due to left complete nature of binary tree, the heap can be stored in
41 / 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.
42 / 50
A heap is a left-complete binary tree that conforms to the ___________
43 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
44 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
45 / 50
After sorting in merge sort algorithm, merging process is invoked.
46 / 50
Which may be stable sort:
47 / 50
48 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
49 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
50 / 50
Random access machine or RAM is a/an
Your score is
The average score is 40%
Restart quiz
