CS502-Midterm
1 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
2 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
3 / 50
The sieve technique works in ___________ as follows
4 / 50
Sorting can be in _________
5 / 50
For the heap sort, access to nodes involves simple _______________ operations.
6 / 50
In Sieve Technique we do not know which item is of interest
7 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
8 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
9 / 50
______________ graphical representation of algorithm.
10 / 50
11 / 50
Random access machine or RAM is a/an
12 / 50
How much time merge sort takes for an array of numbers?
13 / 50
Consider the following code:
For(j=1; j
For(k=1; k<15;k++)
For(l=5; l
{
Do_something_constant();
}
What is the order of execution for this code.
14 / 50
15 / 50
One example of in place but not stable algorithm is
16 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
17 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
18 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
19 / 50
What type of instructions Random Access Machine (RAM) can execute?
20 / 50
The O-notation is used to state only the asymptotic ________bounds.
21 / 50
The sieve technique is a special case, where the number of sub problems is just
22 / 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.
23 / 50
Efficient algorithm requires less computational…….
24 / 50
25 / 50
Analysis of Selection algorithm ends up with,
26 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
27 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
28 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
29 / 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
30 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
31 / 50
If there are Θ (n2) entries in edit distance matrix then the total running time is
32 / 50
One Example of in place but not stable sort is
33 / 50
Is it possible to sort without making comparisons?
34 / 50
What is the total time to heapify?
35 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
36 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
37 / 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.
38 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
39 / 50
40 / 50
The number of nodes in a complete binary tree of height h is
41 / 50
When we call heapify then at each level the comparison performed takes time
42 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
43 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
44 / 50
Due to left complete nature of binary tree, the heap can be stored in
45 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
46 / 50
Which sorting algorithm is faster
47 / 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.
48 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
49 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
50 / 50
In RAM model instructions are executed
Your score is
The average score is 40%
Restart quiz
