CS502-Midterm
1 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
2 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
3 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
4 / 50
In Heap Sort algorithm, the maximum levels an element can move upward is _________
5 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
6 / 50
Quick sort is
7 / 50
Divide-and-conquer as breaking the problem into a small number of
8 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
9 / 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,
10 / 50
For the heap sort we store the tree nodes in
11 / 50
What is the total time to heapify?
12 / 50
If the indices passed to merge sort algorithm are ________,then this means that there is only one element to sort.
13 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
14 / 50
Counting sort has time complexity:
15 / 50
For the Sieve Technique we take time
16 / 50
A RAM is an idealized machine with ______________ random-access memory.
17 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
18 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
19 / 50
The sieve technique is a special case, where the number of sub problems is just
20 / 50
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
21 / 50
For the sieve technique we solve the problem,
22 / 50
Efficient algorithm requires less computational…….
23 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
24 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
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
How much time merge sort takes for an array of numbers?
27 / 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.
28 / 50
Sieve Technique can be applied to selection problem?
29 / 50
Which sorting algorithm is faster
30 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
31 / 50
Cont sort is suitable to sort the elements in range 1 to k
32 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
33 / 50
The Knapsack problem belongs to the domain of _______________ problems.
34 / 50
Due to left complete nature of binary tree, the heap can be stored in
35 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
36 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
37 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
38 / 50
The sieve technique works where we have to find _________ item(s) from a large input.
39 / 50
40 / 50
In RAM model instructions are executed
41 / 50
Which may be stable sort:
42 / 50
Is it possible to sort without making comparisons?
43 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
44 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
45 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
46 / 50
In Quick Sort Constants hidden in T(n log n) are
47 / 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.
48 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
49 / 50
The number of nodes in a complete binary tree of height h is
50 / 50
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
Your score is
The average score is 40%
Restart quiz
