CS502-Midterm
1 / 50
A (an) _________ is a left-complete binary tree that conforms to the heap order
2 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
3 / 50
Which sorting algorithm is faster
4 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
5 / 50
In Heap Sort algorithm, if heap property is violated _________
6 / 50
Quick sort is best from the perspective of Locality of reference.
7 / 50
For the Sieve Technique we take time
8 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
9 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
10 / 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.
11 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
12 / 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.
13 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
14 / 50
How much time merge sort takes for an array of numbers?
15 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
16 / 50
Analysis of Selection algorithm ends up with,
17 / 50
Sieve Technique can be applied to selection problem?
18 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
19 / 50
A heap is a left-complete binary tree that conforms to the ___________
20 / 50
When we call heapify then at each level the comparison performed takes time
21 / 50
Algorithm is concerned with.......issues.
22 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
23 / 50
In ____________ we have to find rank of an element from given input.
24 / 50
The Knapsack problem belongs to the domain of _______________ problems.
25 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
26 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
27 / 50
_______________ is a graphical representation of an algorithm
28 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
29 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
30 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
31 / 50
For the heap sort, access to nodes involves simple _______________ operations.
32 / 50
In Sieve Technique we do not know which item is of interest
33 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
34 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
35 / 50
The sieve technique works in ___________ as follows
36 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
37 / 50
The O-notation is used to state only the asymptotic ________bounds.
38 / 50
Efficient algorithm requires less computational…….
39 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
40 / 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.
41 / 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
42 / 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.
43 / 50
Divide-and-conquer as breaking the problem into a small number of
44 / 50
45 / 50
A RAM is an idealized machine with ______________ random-access memory.
46 / 50
What type of instructions Random Access Machine (RAM) can execute? Choose best answer
47 / 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.
48 / 50
In simple brute-force algorithm, we give no thought to efficiency.
49 / 50
In which order we can sort?
50 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
Your score is
The average score is 40%
Restart quiz
