CS502-Midterm
1 / 50
In which order we can sort?
2 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
3 / 50
The analysis of Selection algorithm shows the total running time is indeed ________in n,
4 / 50
What is the total time to heapify?
5 / 50
One example of in place but not stable algorithm is
6 / 50
In RAM model instructions are executed
7 / 50
For the sieve technique we solve the problem,
8 / 50
Counting sort has time complexity:
9 / 50
Quick sort is
10 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
11 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
12 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
13 / 50
In Quick Sort Constants hidden in T(n log n) are
14 / 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.
15 / 50
What type of instructions Random Access Machine (RAM) can execute?
16 / 50
In Sieve Technique we do not know which item is of interest
17 / 50
Efficient algorithm requires less computational…….
18 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
19 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
20 / 50
Algorithm is concerned with.......issues.
21 / 50
How much time merge sort takes for an array of numbers?
22 / 50
For the Sieve Technique we take time
23 / 50
Which may be a stable sort?
24 / 50
A heap is a left-complete binary tree that conforms to the ___________
25 / 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
26 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
27 / 50
Due to left complete nature of binary tree, the heap can be stored in
28 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
29 / 50
Sieve Technique can be applied to selection problem?
30 / 50
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
31 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
32 / 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.
33 / 50
After sorting in merge sort algorithm, merging process is invoked.
34 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
35 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
36 / 50
The Knapsack problem belongs to the domain of _______________ problems.
37 / 50
In ____________ we have to find rank of an element from given input.
38 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
39 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
40 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
41 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
42 / 50
The O-notation is used to state only the asymptotic ________bounds.
43 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
44 / 50
Divide-and-conquer as breaking the problem into a small number of
45 / 50
For the heap sort, access to nodes involves simple _______________ operations.
46 / 50
When we call heapify then at each level the comparison performed takes time
47 / 50
Random access machine or RAM is a/an
48 / 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,
49 / 50
Is it possible to sort without making comparisons?
50 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
Your score is
The average score is 40%
Restart quiz
