CS502-Midterm
1 / 50
What is the total time to heapify?
2 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
3 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
4 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
5 / 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.
6 / 50
One example of in place but not stable algorithm is
7 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
8 / 50
An in place sorting algorithm is one that uses ___ arrays for storage
9 / 50
When we call heapify then at each level the comparison performed takes time
10 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
11 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
12 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
13 / 50
One Example of in place but not stable sort is
14 / 50
15 / 50
The number of nodes in a complete binary tree of height h is
16 / 50
The sieve technique works in ___________ as follows
17 / 50
Which sorting algorithm is faster
18 / 50
For the sieve technique we solve the problem,
19 / 50
How much time merge sort takes for an array of numbers?
20 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
21 / 50
The O-notation is used to state only the asymptotic ________bounds.
22 / 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.
23 / 50
In simple brute-force algorithm, we give no thought to efficiency.
24 / 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.
25 / 50
Efficient algorithm requires less computational…….
26 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
27 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
28 / 50
In Quick Sort Constants hidden in T(n log n) are
29 / 50
For the Sieve Technique we take time
30 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
31 / 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.
32 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
33 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
34 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
35 / 50
36 / 50
For the heap sort we store the tree nodes in
37 / 50
What type of instructions Random Access Machine (RAM) can execute?
38 / 50
A RAM is an idealized machine with ______________ random-access memory.
39 / 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.
40 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
41 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
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
The running time of quick sort depends heavily on the selection of
44 / 50
Sieve Technique can be applied to selection problem?
45 / 50
_______________ is a graphical representation of an algorithm
46 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
47 / 50
In Sieve Technique we do not know which item is of interest
48 / 50
Slow sorting algorithms run in,
49 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
50 / 50
In Heap Sort algorithm, if heap property is violated _________
Your score is
The average score is 40%
Restart quiz
