CS502-Midterm
1 / 50
_______________ is a graphical representation of an algorithm
2 / 50
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
3 / 50
In RAM model instructions are executed
4 / 50
What is the total time to heapify?
5 / 50
A RAM is an idealized machine with ______________ random-access memory.
6 / 50
The definition of Theta-notation relies on proving ___________asymptotic bound.
7 / 50
In Sieve Technique we do not know which item is of interest
8 / 50
How much time merge sort takes for an array of numbers?
9 / 50
For Chain Matrix Multiplication we can not use divide and conquer approach because,
10 / 50
In ____________ we have to find rank of an element from given input.
11 / 50
Cont sort is suitable to sort the elements in range 1 to k
12 / 50
In Quick sort, we don’t have the control over the sizes of recursive calls
13 / 50
An algorithm is a mathematical entity that is dependent on a specific programming language.
14 / 50
Floor and ceiling are ____________ to calculate while analyzing algorithms.
15 / 50
In simple brute-force algorithm, we give no thought to efficiency.
16 / 50
While Sorting, the ordered domain means for any two input elements x and y _________ satisfies only.
17 / 50
A heap is a left-complete binary tree that conforms to the ___________
18 / 50
For the heap sort, access to nodes involves simple _______________ operations.
19 / 50
Brute-force algorithm uses no intelligence in pruning out decisions.
20 / 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.
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
F (n) and g (n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
23 / 50
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
24 / 50
Due to left complete nature of binary tree, the heap can be stored in
25 / 50
The ancient Roman politicians understood an important principle of good algorithm design that is plan-sweep algorithm.
26 / 50
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
27 / 50
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
28 / 50
29 / 50
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
30 / 50
The Knapsack problem belongs to the domain of _______________ problems.
31 / 50
Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
32 / 50
One Example of in place but not stable sort is
33 / 50
In selection algorithm, because we eliminate a constant fraction of the array with each phase, we get the
34 / 50
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
35 / 50
Sorting can be in _________
36 / 50
Quick sort is best from the perspective of Locality of reference.
37 / 50
While solving Selection problem, in Sieve technique we partition input data __________w
38 / 50
Is it possible to sort without making comparisons?
39 / 50
For the heap sort we store the tree nodes in
40 / 50
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
41 / 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.
42 / 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.
43 / 50
In Heap Sort algorithm, we build _______ for ascending sort.
44 / 50
Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
45 / 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.
46 / 50
Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
47 / 50
One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
48 / 50
The function f(n)=n(logn+1)/2 is asymptotically equivalent to nlog n. Here Lower Bound means function f(n) grows asymptotically at ____________ as fast as nlog n.
49 / 50
Divide-and-conquer as breaking the problem into a small number of
50 / 50
One example of in place but not stable algorithm is
Your score is
The average score is 40%
Restart quiz
