CS502-Midterm
1 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
2 / 50
We cannot make any significant improvement in the running time which is better than that of brute-force algorithm.
3 / 50
After sorting in merge sort algorithm, merging process is invoked.
4 / 50
_______________ is a graphical representation of an algorithm
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
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
8 / 50
A RAM is an idealized machine with ______________ random-access memory.
9 / 50
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
10 / 50
Random access machine or RAM is a/an
11 / 50
Efficient algorithm requires less computational…….
12 / 50
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
13 / 50
One example of in place but not stable algorithm is
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
The O-notation is used to state only the asymptotic ________bounds.
16 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
17 / 50
The time assumed for each basic operation to execute on RAM model of computation is-----
18 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
19 / 50
Divide-and-conquer as breaking the problem into a small number of
20 / 50
What is the solution to the recurrence T(n) = T(n/2)+n .
21 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
22 / 50
Is it possible to sort without making comparisons?
23 / 50
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
24 / 50
For the heap sort we store the tree nodes in
25 / 50
Due to left complete nature of binary tree, the heap can be stored in
26 / 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.
27 / 50
Sorting can be in _________
28 / 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,
29 / 50
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
30 / 50
What type of instructions Random Access Machine (RAM) can execute?
31 / 50
Quick sort is
32 / 50
In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.
33 / 50
Analysis of Selection algorithm ends up with,
34 / 50
Sieve Technique applies to problems where we are interested in finding a single item
from a larger set of _____________
35 / 50
In Heap Sort algorithm, the total running time for Heapify procedure is ____________
36 / 50
The running time of quick sort depends heavily on the selection of
37 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
38 / 50
In ____________ we have to find rank of an element from given input.
39 / 50
Asymptotic growth rate of the function is taken over_________ case running time.
40 / 50
In Heap Sort algorithm, if heap property is violated _________
41 / 50
One Example of in place but not stable sort is
42 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
43 / 50
Which may be a stable sort?
44 / 50
In 2d-space a point is said to be ________if it is not dominated by any other point in that space.
45 / 50
In pseudo code, the level of details depends on intended audience of the algorithm.w
46 / 50
The sieve technique is a special case, where the number of sub problems is just
47 / 50
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
48 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
49 / 50
The Knapsack problem belongs to the domain of _______________ problems.
50 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
Your score is
The average score is 40%
Restart quiz
