CS502-Midterm
1 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
2 / 50
One example of in place but not stable algorithm is
3 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
4 / 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.
5 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
6 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
7 / 50
Counting sort has time complexity:
8 / 50
For the Sieve Technique we take time
9 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
10 / 50
Which sorting algorithm is faster
11 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
12 / 50
In analysis of f (n) =n (n/5) +n-10 log n, f (n) is asymptotically equivalent to ________.
13 / 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.
14 / 50
What type of instructions Random Access Machine (RAM) can execute?
15 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
16 / 50
In ____________ we have to find rank of an element from given input.
17 / 50
Analysis of Selection algorithm ends up with,
18 / 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.
19 / 50
After sorting in merge sort algorithm, merging process is invoked.
20 / 50
Quick sort is
21 / 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
22 / 50
The Knapsack problem belongs to the domain of _______________ problems.
23 / 50
In Sieve Technique we do not know which item is of interest
24 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
25 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
26 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
27 / 50
Is it possible to sort without making comparisons?
28 / 50
Sorting can be in _________
29 / 50
In Quick Sort Constants hidden in T(n log n) are
30 / 50
In the analysis of Selection algorithm, we eliminate a constant fraction of the array with each phase; we get the convergent _______________ series in the analysis,
31 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
32 / 50
What is the total time to heapify?
33 / 50
The sieve technique is a special case, where the number of sub problems is just
34 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
35 / 50
The running time of quick sort depends heavily on the selection of
36 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
37 / 50
38 / 50
In Heap Sort algorithm, if heap property is violated _________
39 / 50
Efficient algorithm requires less computational…….
40 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
41 / 50
A heap is a left-complete binary tree that conforms to the ___________
42 / 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.
43 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
44 / 50
45 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
46 / 50
In RAM model instructions are executed
47 / 50
48 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
49 / 50
One Example of in place but not stable sort is
50 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
Your score is
The average score is 40%
Restart quiz
