CS502-Midterm
1 / 50
______________ graphical representation of algorithm.
2 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
3 / 50
A heap is a left-complete binary tree that conforms to the ___________
4 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
5 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
6 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
7 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
8 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
9 / 50
Slow sorting algorithms run in,
10 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
11 / 50
In simple brute-force algorithm, we give no thought to efficiency.
12 / 50
One example of in place but not stable algorithm is
13 / 50
The Knapsack problem belongs to the domain of _______________ problems.
14 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
15 / 50
What is the total time to heapify?
16 / 50
The sieve technique works in ___________ as follows
17 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
18 / 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.
19 / 50
The array to be sorted is not passed as argument to the merge sort algorithm.
20 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
21 / 50
Is it possible to sort without making comparisons?
22 / 50
Efficient algorithm requires less computational…….
23 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
24 / 50
25 / 50
The sieve technique is a special case, where the number of sub problems is just
26 / 50
Quick sort is best from the perspective of Locality of reference.
27 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
28 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
29 / 50
How much time merge sort takes for an array of numbers?
30 / 50
Sorting can be in _________
31 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
32 / 50
For the heap sort we store the tree nodes in
33 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
34 / 50
When we call heapify then at each level the comparison performed takes time
35 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
36 / 50
Sieve Technique can be applied to selection problem?
37 / 50
For the sieve technique we solve the problem,
38 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
39 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
40 / 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.
41 / 50
The running time of quick sort depends heavily on the selection of
42 / 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
43 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
44 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
45 / 50
For the Sieve Technique we take time
46 / 50
In which order we can sort?
47 / 50
Which may be stable sort:
48 / 50
49 / 50
_______________ is a graphical representation of an algorithm
50 / 50
In Sieve Technique we do not know which item is of interest
Your score is
The average score is 40%
Restart quiz
